标签：des style color io ar java for sp div
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;
* next = null;
* }
* }
*/
public class Solution {
public ListNode partition(ListNode head, int x) {
ListNode leftHead=new ListNode(0);
ListNode rightHead=new ListNode(0);
ListNode pLeft=leftHead;
ListNode pRight=rightHead;
for(ListNode p=head;p!=null;p=p.next)
{
if(p.val<x)
{
pLeft.next=p;
pLeft=p;
}
else
{
pRight.next=p;
pRight=p;
}
}
pRight.next=null;
pLeft.next=rightHead.next;
return leftHead.next;
}
}标签：des style color io ar java for sp div
原文地址：http://blog.csdn.net/jiewuyou/article/details/40072779
