LeetCode Partition List

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.

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode *partition(ListNode *head, int x) {
        ListNode* ret = NULL;
		ListNode** small = &ret;
		ListNode** cur = &head;
		while(*cur != NULL)
		{
			if((*cur)->val < x)
			{
				*small = *cur;
				small = &(*small)->next;
				*cur = (*cur)->next;
			}
			else
			{
				cur = &(*cur)->next;
			}
		}
		*small = head;
		return ret;
    }
};