diff --git a/solution/0200-0299/0206.Reverse Linked List/README.md b/solution/0200-0299/0206.Reverse Linked List/README.md
index 47a1f01bee223..25af2739594d0 100644
--- a/solution/0200-0299/0206.Reverse Linked List/README.md	
+++ b/solution/0200-0299/0206.Reverse Linked List/README.md	
@@ -37,13 +37,15 @@
 
 class Solution:
     def reverseList(self, head: ListNode) -> ListNode:
-        pre, p = None, head
-        while p:
-            q = p.next
-            p.next = pre
-            pre = p
-            p = q
-        return pre
+        previous, current, next = None, head, None
+        
+        while current is not None:
+            next = current.next
+            current.next = previous
+            previous = current
+            current = next
+        
+        return previous
 ```
 
 ### **Java**
diff --git a/solution/0200-0299/0206.Reverse Linked List/README_EN.md b/solution/0200-0299/0206.Reverse Linked List/README_EN.md
index f753eb65efaea..5c6d17c2a9a8f 100644
--- a/solution/0200-0299/0206.Reverse Linked List/README_EN.md	
+++ b/solution/0200-0299/0206.Reverse Linked List/README_EN.md	
@@ -54,13 +54,15 @@
 
 class Solution:
     def reverseList(self, head: ListNode) -> ListNode:
-        pre, p = None, head
-        while p:
-            q = p.next
-            p.next = pre
-            pre = p
-            p = q
-        return pre
+        previous, current, next = None, head, None
+        
+        while current is not None:
+            next = current.next
+            current.next = previous
+            previous = current
+            current = next
+        
+        return previous
 ```
 
 ### **Java**
diff --git a/solution/0200-0299/0206.Reverse Linked List/Solution.py b/solution/0200-0299/0206.Reverse Linked List/Solution.py
index fb8aabb5ef6a1..e3099be454573 100644
--- a/solution/0200-0299/0206.Reverse Linked List/Solution.py	
+++ b/solution/0200-0299/0206.Reverse Linked List/Solution.py	
@@ -6,10 +6,12 @@
 
 class Solution:
     def reverseList(self, head: ListNode) -> ListNode:
-        pre, p = None, head
-        while p:
-            q = p.next
-            p.next = pre
-            pre = p
-            p = q
-        return pre
+        previous, current, next = None, head, None
+        
+        while current is not None:
+            next = current.next
+            current.next = previous
+            previous = current
+            current = next
+        
+        return previous