doocs · Feb 10, 2022 · Feb 10, 2022
Showing with 27 additions and 21 deletions.

+9 −7 solution/0200-0299/0206.Reverse Linked List/README.md

+9 −7 solution/0200-0299/0206.Reverse Linked List/README_EN.md

+9 −7 solution/0200-0299/0206.Reverse Linked List/Solution.py
diff --git 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
@@ -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
@@ -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