相对位置链表排序

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.

For example,
Given1->4->3->2->5->2 and x = 3,
return1->2->2->4->3->5.

ListNode* partition(ListNode* head, int x) {
	//preHead1与preHead2分别为两个链表头结点的前移节点
        //（一个链表的节点值小于x，另一个大于等于x）
	ListNode* preHead1 = new ListNode(0), *preHead2 = new ListNode(0);
	ListNode* cur1 = preHead1, *cur2 = preHead2;
	while (head) {
		if (head->val < x) {
			cur1->next = head;
			cur1 = cur1->next;
		}
		else {
			cur2->next = head;
			cur2 = cur2->next;
		}
		head = head->next;
	}
	cur1->next = preHead2->next;
	cur2->next = NULL;
	return preHead1->next;
}