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.

For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

/*
	利用两个链表lessList,greaterList，分别存放小于x的结点，还有大于x的结点.最后，再合并两个链表，lessList 和 greaterList.
*/
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 head;
		ListNode *lessList = new ListNode(0);
		ListNode *greaterList = new ListNode(0);
		ListNode *p = lessList;
		ListNode *q = greaterList;
		while(head != NULL)
		{
			if(head->val < x)
			{
				p->next = head;
				p = p->next;
			    head = head->next;
				p->next = NULL;
			}
			else
			{
				q->next = head;
				q = q->next;
			    head = head->next;
				q->next = NULL;
			}
		}
		p->next = greaterList->next;
		return lessList->next;
    }
};