LeetCode-86、分隔链表-中等
给定一个链表和一个特定值 x,对链表进行分隔,使得所有小于 x 的节点都在大于或等于 x 的节点之前。
你应当保留两个分区中每个节点的初始相对位置。
示例:
输入: head = 1->4->3->2->5->2, x = 3
输出: 1->2->2->4->3->5
代码:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def partition(self, head: ListNode, x: int) -> ListNode:
before = ListNode(None)
after = ListNode(None)
n1 = before
n2 = after
while head:
if head.val < x:
n1.next = head
n1 = n1.next
elif head.val >= x:
n2.next = head
n2 = n2.next
head = head.next
n2.next = head
n1.next = after.next
return before.next