Question
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.
Code
public ListNode partition(ListNode head, int x) {
ListNode min = new ListNode(0);
ListNode max = new ListNode(1);
ListNode minp = min;
ListNode maxp = max;
ListNode p = head;
while (p != null) {
if (p.val < x) {
minp.next = p;
minp = minp.next;
} else {
maxp.next = p;
maxp = maxp.next;
}
p = p.next;
}
minp.next = max.next;
maxp.next = null;
return min.next;
}