【LeetCode】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.

题意：将小于给定值的结点都移到前面，大于该值的结点顺序不变。

方法一：先找到一个大于或等于给定值的结点，例子中是4，然后找小于3的点，每找到一个就将其连在4之前。

class Solution {
public:
    ListNode *partition(ListNode *head, int x) {
        if (head == NULL)
            return NULL;

        ListNode* tmp = new ListNode(-1);
        tmp->next = head;
        ListNode* pre = tmp;
        ListNode* pCur = head;

        //当前结点的值小于x直接向后走
        while (pre->next&&pre->next->val < x)
        {
            pre = pre->next;
        }

        pCur = pre;
        while (pCur->next)
        {
            if (pCur->next->val < x)
            {
                ListNode *p = pCur->next;
                pCur->next = p->next;
                p->next = pre->next;
                pre->next = p;
                pre = pre->next;
            }
            else
                pCur = pCur->next;
        }
        return tmp->next;
    }
};

方法二：将所有的小于给定值的结点取出组成一个新的链表，此时原链表中剩余的结点都大于或等于给定值，将原链表直接链在新链表后。

class Solution {
public:
    ListNode *partition(ListNode *head, int x) {
        if (head == NULL)
            return NULL;

        ListNode* pList = new ListNode(-1);
        ListNode* newpList = new ListNode(-1);
        pList->next = head;
        ListNode* pCur = pList;
        ListNode* p = newpList;

        while (pCur->next)
        {
            if (pCur->next->val < x)
            {
                p->next = pCur->next;
                p = p->next;
                pCur->next = pCur->next->next;
                p->next = NULL;
            }
            else
                pCur = pCur->next;
        }
        p->next = pList->next;
        return newpList->next;
    }
};