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

/**
 * 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) {
        if(head == nullptr)     return nullptr;
        ListNode *dumy = new ListNode(-1);
        dumy->next = head;
        ListNode *p = dumy, *last = dumy;
        while(p->next)
        {
            if(p->next->val >= x)
                p = p->next;
            else
            {
                ListNode *pNext = p->next;
                p->next = pNext->next;
                pNext->next = last->next;
                last->next = pNext;
                last = pNext;
                p = pNext;
            }
        }
        ListNode *res = dumy->next;
        delete dumy;
        return res;
    }
};