leetcode: 86. Partition List

原创于 2017-11-21 10:11:51 发布 · 423 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode-Python 专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一个链表分区算法，该算法能确保所有小于给定值x的节点位于大于或等于x的节点之前，并保持各分区内的相对顺序不变。举例说明了如何通过此算法将输入链表1->4->3->2->5->2且x为3的情况下，得到1->2->2->4->3->5的正确输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

# 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.
#
# For example,
# Given 1->4->3->2->5->2 and x = 3,
# return 1->2->2->4->3->5.

AC

class ListNode():
    def __init__(self, x):
        self.val = x
        self.next = None

class Solution():
    def partition(self, head, x):
        h1 = t1 = ListNode(-1)
        h2 = t2 = ListNode(-1)
        cur = head
        while cur:
            if cur.val < x:
                t1.next = cur
                t1 = t1.next
            else:
                t2.next = cur
                t2 = t2.next
            cur = cur.next
        t1.next, t2.next = h2.next, None
        return h1.next


if __name__ == "__main__":
    head, head.next, head.next.next, head.next.next.next, head.next.next.next.next, head.next.next.next.next.next \
        = ListNode(1), ListNode(4), ListNode(3), ListNode(2), ListNode(5), ListNode(2)
    print(Solution().partition(head, 3))