Partition List

题目大意：给定一个链表和一个数值，要使得链表中小于给定数值的节点排在前面，并且保持原来的前后顺序。

/**
 * 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 == NULL) {
            return NULL;
        }
        ListNode *pre = NULL, *partition = NULL, *cur = head;
        while(cur != NULL) {
            if(cur->val < x) {
                if(pre == NULL) {
                    partition = cur;
                    head = cur;
                } else {
                    if(partition == pre) {
                        partition = cur;
                    } else {
                        pre->next = cur->next;
                        if(partition == NULL) {
                            partition = cur;
                            cur->next = head;
                            head = cur;
                        } else {
                            cur->next = partition->next;
                            partition->next = cur;
                            partition = cur;
                        }
                        cur = pre->next;
                        continue;
                    }
                }
            }
            pre = cur;
            cur = cur->next;
        }
        return head;
    }
};