Merge pull request #2232 from Donghae0230/main

[Donghae0230] WEEK 07 solutions

Author: TonyKim9401

reverse-linked-list/Donghae0230.py

@@ -0,0 +1,22 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
+        temp = []
+        while head:
+            temp.append(int(head.val))            
+            head = head.next
+        temp = list(reversed(temp))
+        print(temp)
+        
+        dummy = ListNode(0)
+        tail = dummy
+        for i in temp:
+            # print(i, tail)
+            tail.next = ListNode(i)
+            tail = tail.next
+        # print(dummy)
+        return dummy.next