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.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode partition(ListNode head, int x) {
if (head == null)
return null;
ListNode start = new ListNode(0);
start.next = head;
ListNode cur= head;
ListNode left = start;
ListNode right = null;
while (cur != null) {
if (cur.val < x) {
if (right == null) {
left = cur;
cur = cur.next;
} else {
right.next = cur.next;
cur.next = left.next;
left.next = cur;
left = cur;
cur = right.next;
}
} else {
right = cur;
cur = cur.next;
}
}
return start.next;
}
}