LeetCode：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.

题目解析：

给定一个链表和一个值x，对它进行分区，使得小于x的所有节点都在大于或等于x的节点之前出现。保留两个分区中的每个节点的原始相对顺序。

思路：新建两个头结点，分别指向两个链表的头结点。其中一个链表的节点值小于x的值，另一个链表的节点值大于等于x的值，最后将两个链表连起来。

AC代码 ：

/**
 * 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* newHead1 = new ListNode(0);
        ListNode* newHead2 = new ListNode(0);
        ListNode* cur1 = newHead1;
        ListNode* cur2 = newHead2;
        while(head != NULL)
        {
            if(head->val < x){
                cur1->next = head;
                cur1 = cur1->next;
            }
            else{
                cur2->next = head;
                cur2 = cur2->next;
            }
            head = head->next;
        }
        cur1->next = newHead2->next;
        cur2->next = NULL;
        return newHead1->next;
    }
};

(*^▽^*)