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.

两个链，p存小于x的，q存大于等于x的，最后把p的尾巴指向q的头，返回p的头即可

/**
 * 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 dummyS(-1),dummyB(-1);
        ListNode*p=&dummyS,*q=&dummyB;
        while(head){
            if(head->val<x){
                p->next=head;
                p=head;
            }
            else{
                q->next=head;
                q=head;
            }
            head=head->next;
        }
        p->next=dummyB.next;
        q->next=NULL;
        return dummyS.next;
    }
};