86. Partition List(unsolved)

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.

解答:设定两个指针头，一个连接所有小于x的，一个连接所有大于x的，然后把这两段连接起来

/**
 * 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 *pleft=new ListNode(0);
        ListNode *pright=new ListNode(0);
        pleft->next=head;
        pright->next=head;
        ListNode *plhead=pleft;
        ListNode *prhead=pright;

        while(head)
        {
            if(head->val<x)
            {
                pleft->next=head;
                pleft=pleft->next;
            }
            else
            {
                pright->next=head;
                pright=pright->next;
            }
            head=head->next;
        }
        pright->next=NULL;
        pleft->next=prhead->next;

        return plhead->next;



    }
};