Problem:
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
.
Solution:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode partition(ListNode head, int x) {
ListNode h = new ListNode(-1);
h.next = head;
ListNode p=h.next,q=h;
while(p!=null&&p.val<x)
{
q = p;
p = p.next;
}
while(p!=null&&p.next!=null)
{
if(p.next.val<x)
{
ListNode tmp = q.next;
q.next = p.next;
p.next = p.next.next;
q.next.next = tmp;
q = q.next;
}
else
{
p = p.next;
}
}
return h.next;
}
}
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode partition(ListNode head, int x) {
ListNode h = new ListNode(-1);
h.next = head;
ListNode p=h.next,q=h;
while(p!=null&&p.val<x)
{
q = p;
p = p.next;
}
while(p!=null&&p.next!=null)
{
if(p.next.val<x)
{
ListNode tmp = q.next;
q.next = p.next;
p.next = p.next.next;
q.next.next = tmp;
q = q.next;
}
else
{
p = p.next;
}
}
return h.next;
}
}