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==NULL || head->next == NULL) return head;
        ListNode *p = NULL, *q = head;  //p is the precursor of q, q is the first node whose val no less than x.
        while(q && q->val < x){ p = q; q = q->next; }
        ListNode *r = NULL, *pr = q;
        if(q) r = q->next;
        while(r){
            if(r->val < x){
                pr->next = r->next;
                if(p==NULL){ r->next = head; head = r; p = r;}
                else{
                    p->next = r;
                    r->next = q;
                    p = r;
                }
                r = pr->next;
            }
            else{ pr = r; r = r->next; }
        }
        
        return head;
    }
};