From ebad1f407fa5ccf07858a06839e1f9bd2a18e39c Mon Sep 17 00:00:00 2001
From: ji-hyup <newnyup@gmail.com>
Date: Wed, 27 May 2026 17:51:10 +0900
Subject: [PATCH] 27

---
 .../206. Reverse Linked List.py"              | 42 +++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 "leetcode3/\353\263\200\354\247\200\355\230\221/206. Reverse Linked List.py"

diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/206. Reverse Linked List.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/206. Reverse Linked List.py"
new file mode 100644
index 00000000..c9d1f48f
--- /dev/null
+++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/206. Reverse Linked List.py"	
@@ -0,0 +1,42 @@
+'''
+1. 아이디어 :
+2. 시간복잡도 :
+    O(n)
+3. 자료구조/알고리즘 :
+'''
+
+# 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]:
+        """
+        :type head: Optional[ListNode]
+        :rtype: Optional[ListNode]
+        """
+        if head == None:
+            return None
+        temp = []
+        _next = head
+        while True:
+            val = _next.val
+            _next = _next.next
+
+            temp.append(val)
+
+            if _next is None:
+                break
+
+        # temp = temp[::-1]
+        prev = None
+        for i in range(len(temp)):
+            # if prev is not None:
+                # print(prev.val)
+            prev = ListNode(val=temp[i], next=prev)
+
+        print(prev.next, prev.val)
+        
+        return prev
+            
\ No newline at end of file