LeetCode86. Partition List（C++）

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.

Example:

Input: head = 1->4->3->2->5->2, x = 3
Output: 1->2->2->4->3->5

解题思路：双指针法，p、q指针同时开始遍历，遇到值大于等于x的节点，则q前移，遇到小于的，则将该节点插入p节点后，p、q同时前移

/**
 * 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 *p = new ListNode(0),*q = head,*pre;
        p->next = head;
        pre = p;head = p;
        while(q != NULL){
            if(q->val < x && pre != p){
               pre->next = q->next;
               q->next = p->next;
               p->next = q;
               p = q;
               q = pre->next;
            }
            else if(p == pre && q->val < x){
                pre = pre->next;
                q = q->next;
                p = p->next;
            }   
            else{
                pre = pre->next;
                q = q->next;
            }
        }
        return head->next;
    }
};