Partition List

用两个新的头结点分别指向比x小的部分，和大于等于x的部分，将他们串起来

//设x = 3
//1  4  3  2  2  5
//       small_head             small_ptr
//smaller            1       2       2
//bigger             4       3       5
//                               bigger_ptr
//small_ptr指向bigger_head->next,bigger_ptr->next空

/**
 * 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 == nullptr || head->next == nullptr)
            return head;
        
        ListNode small_head(0);
        ListNode bigger_head(0);
        ListNode* small_ptr = &small_head;
        ListNode* bigger_ptr = &bigger_head;
        
        while(head)
        {
            if(head->val < x)
            {
                small_ptr->next = head;
                small_ptr = head;
            }else{
                bigger_ptr->next = head;
                bigger_ptr = head;
            }
            head = head->next;
        }
        
        small_ptr->next = bigger_head.next;
        bigger_ptr->next = nullptr;
        return small_head.next;
    }
};