From 2f39c7df81006b963f48cf79251e1f83ff8a61bb Mon Sep 17 00:00:00 2001
From: Steve0x2a <stevesough@gmail.com>
Date: Sun, 15 Aug 2021 14:40:48 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00143=E9=87=8D=E6=8E=92?=
 =?UTF-8?q?=E9=93=BE=E8=A1=A8=20Python=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0143.重排链表.md | 54 +++++++++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)

diff --git a/problems/0143.重排链表.md b/problems/0143.重排链表.md
index 62232051..76df63b7 100644
--- a/problems/0143.重排链表.md
+++ b/problems/0143.重排链表.md
@@ -222,7 +222,61 @@ public class ReorderList {
 ```
 
 Python：
+```python3
+# 方法二 双向队列
+class Solution:
+    def reorderList(self, head: ListNode) -> None:
+        """
+        Do not return anything, modify head in-place instead.
+        """
+        d = collections.deque()
+        tmp = head
+        while tmp.next: # 链表除了首元素全部加入双向队列
+            d.append(tmp.next)
+            tmp = tmp.next
+        tmp = head
+        while len(d): # 一后一前加入链表
+            tmp.next = d.pop()
+            tmp = tmp.next
+            if len(d):
+                tmp.next = d.popleft()
+                tmp = tmp.next
+        tmp.next = None # 尾部置空
+ 
+# 方法三 反转链表
+class Solution:
+    def reorderList(self, head: ListNode) -> None:
+        if head == None or head.next == None:
+            return True
+        slow, fast = head, head
+        while fast and fast.next:
+            slow = slow.next
+            fast = fast.next.next
+        right = slow.next # 分割右半边
+        slow.next = None # 切断
+        right = self.reverseList(right) #反转右半边
+        left = head
+        # 左半边一定比右半边长, 因此判断右半边即可
+        while right:
+            curLeft = left.next
+            left.next = right
+            left = curLeft
 
+            curRight = right.next
+            right.next = left
+            right = curRight
+
+
+    def reverseList(self, head: ListNode) -> ListNode:
+        cur = head   
+        pre = None
+        while(cur!=None):
+            temp = cur.next # 保存一下cur的下一个节点
+            cur.next = pre # 反转
+            pre = cur
+            cur = temp
+        return pre
+```
 Go：
 
 JavaScript：