[LeetCode] 86. Partition List

最新推荐文章于 2020-02-22 16:00:54 发布

啊黎

最新推荐文章于 2020-02-22 16:00:54 发布

阅读量199

点赞数

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

本文链接：https://blog.csdn.net/ouwenjie10/article/details/57195468

版权

LeetCode解题专栏收录该内容

34 篇文章 0 订阅

订阅专栏

[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.

For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.

思路：定义两个指针，一个负责链接小于x的值，另一个负责链接大于等于x的值，最后把两个链表连起来。

class Solution {
public:
    ListNode* partition(ListNode* head, int x) {
        ListNode* l = new ListNode(-1);
        ListNode* r = new ListNode(-1);
        ListNode* rh = r;
        ListNode* lh = l;

        ListNode* p = head;

        while (p != NULL) {
            if (p->val < x) {
                l->next = p;
                l = l->next;
            } else {
                r->next = p;
                r = r->next;
            }
            p = p->next;
        }
        r->next = NULL;
        l->next = rh->next;
        return lh->next;
    }
};