LeetCode 86. Partition List

最新推荐文章于 2024-01-17 14:19:03 发布

David_DLUT

最新推荐文章于 2024-01-17 14:19:03 发布

阅读量282

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/David_DLUT/article/details/53940500

LeetCode 专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一种链表分区算法，该算法将链表中小于给定值x的所有节点置于大于等于x的节点之前，同时保持各分区内部节点的原始相对顺序不变。例如，对于链表1->4->3->2->5->2和x=3，算法返回1->2->2->4->3->5。代码实现使用了两个辅助链表分别收集小于x和大于等于x的节点，最后将二者连接。

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

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.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* partition(ListNode *head, int x) {
        ListNode smaller_head(0);
        ListNode larger_head(0);
        ListNode *smaller_tail = &smaller_head;
        ListNode *larger_tail = &larger_head;
        while (head != NULL) {
            if (head->val < x) {
                smaller_tail->next = head;
                smaller_tail = head;
            }
            else {
                larger_tail->next = head;
                larger_tail = head;
            }
            head = head->next;
        }
        smaller_tail->next = larger_head.next;
        larger_tail->next = NULL;
        return smaller_head.next;
    }
};