题目:
给定一个单链表 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.
思路:
通过快慢指针找到链表的中间节点;反转后面的节点;将两部分的链表交替连接。
代码:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reorderList(self, head: ListNode) -> None:
"""
Do not return anything, modify head in-place instead.
"""
if not head or not head.next:
return
#找到中间节点
slow,fast = head,head
while fast.next and fast.next.next:
slow = slow.next
fast = fast.next.next
rev = slow.next
slow.next = None
#中间节点之后的节点反转
tmp = None
while rev:
nex = rev.next
rev.next = tmp
tmp = rev
rev = nex
#交替链接
N = head
A = head.next
i = 1
while A or tmp:
if i%2 == 0:
N.next = A
A = A.next
else:
N.next = tmp
tmp = tmp.next
N = N.next
i += 1