leetcode【86】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.

Example:

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

源码：

用两个链表，一个存大值，一个存小值，最后连到一起。时间上68%，空间上100%

/**
 * 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;
        auto small=new ListNode(-1), big=new ListNode(-1), p1=small, p2=big;
        while(head){
            if(head->val>=x){
                p2->next = head;
                p2 = p2->next;
            }
            else{
                p1->next = head;
                p1 = p1->next;
            }
            head = head->next;
        }
        p2->next = NULL;
        p1->next = big->next;
        return small->next;
    }
};