[Leetcode] 86. Partition List

题目

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

You should preserve the original relative order of the nodes in each of the two partitions.

Example:

Input: head = 1->4->3->2->5->2, x = 3
Output: 1->2->2->4->3->5

思路

设定一个标记最后一个小于target的节点low，每当有一个小于target的值就跟在low后面，然后low=low.next

 

Python代码

# 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:
        low = ListNode(None)
        low.next, current = head, head
        res, last = low, low
        while current:
            next_ = current.next
            if current.val < x:
                if low != last:
                    last.next = current.next
                    current.next = low.next
                    low.next = current
                    low = low.next
                else:
                    current.next = low.next.next
                    low.next = current
                    low = low.next
                    last = low
            else:
                last = current
            current = next_
        return res.next