7/26 1Q

Author: kinwjdghks

JungHwan/Day26/NeetCode_ReverseALinkedList.py

@@ -0,0 +1,18 @@
+# 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]:
+        prev, cur = None, head
+
+        while cur:
+            temp = cur
+            cur = cur.next
+            temp.next = prev
+            prev = temp
+
+        return prev
+