给定一个链表和一个特定值 x,对链表进行分隔,使得所有小于 x 的节点都在大于或等于 x 的节点之前。
你应当保留两个分区中每个节点的初始相对位置。
示例:
输入: head = 1->4->3->2->5->2, x = 3 输出: 1->2->2->4->3->5
def partition(self, head, x):
pre = None
res = right = head
while head:
if head.val < x:
if right is head:
pre, head, right = head, head.next, head.next
else:
if pre is None:
head.next, res, head, pre, right.next = res, head, head.next, head, head.next
continue
head.next, pre.next, right.next, head, pre = pre.next, head, head.next, head.next, head
else:
right, head = head, head.next
return res