leetcode 86. Partition List 将val值把分为左右两部分；

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

思路：构建两个带头结点的链表；分别给这两个赋值 最后将大的那个链表接在小的链表之后；

CODE

/**
 * 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||!head->next)
            return head;
        ListNode *bigHead=new ListNode (0);
        ListNode *smallHead=new ListNode(0);
        ListNode *small=smallHead;
        ListNode *big=bigHead;
        ListNode *cur=head;
        while(cur)
        {
            ListNode *temp=new ListNode (cur->val);
            if(cur->val>=x)
            {
                big->next=temp;
                big=big->next;
            }
            else 
            {
                small->next=temp;
                small=small->next;
            }
            cur=cur->next;
            //head=head->next;
        }
        small->next=bigHead->next;
        return smallHead->next;
    }
};