【Leetcode_总结】143. 重排链表 - python

Q：

给定一个单链表 L：L0→L1→…→Ln-1→Ln ，
将其重新排列后变为： L0→Ln→L1→Ln-1→L2→Ln-2→…

你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

示例 1:

给定链表 1->2->3->4, 重新排列为 1->4->2->3.

示例 2:

给定链表 1->2->3->4->5, 重新排列为 1->5->2->4->3.

---

链接：https://leetcode-cn.com/problems/reorder-list/description/

思路：笨方法 不要参考

代码：

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def reorderList(self, head):
        """
        :type head: ListNode
        :rtype: void Do not return anything, modify head in-place instead.
        """
        if not head:
            return head
        tmp = []
        while head:
            tmp.append(head)
            head = head.next
        mid = len(tmp)//2 + 1
        l1 = tmp[:mid]
        l2 = tmp[mid:][::-1]
        l3 = []
        while l2:
            l3.append(l1.pop(0))
            l3.append(l2.pop(0))
        l3+=l1
        head_ = point = l3.pop(0)
        point.next = None
        while l3:
            point.next = l3.pop(0)
            point = point.next
            point.next = None