86. Partition List（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.

Subscribe to see which companies asked this question

移动单链表，将链表以X分开。

注意左右链表的起始点。

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode partition(ListNode head, int x) {
    	ListNode lefthead = new ListNode(-1);
    	ListNode righthead = new ListNode(-1);
    	ListNode left= lefthead;
    	ListNode right =righthead;
    	ListNode cur;
    	for(cur = head;cur!=null;cur = cur.next)
    	{
    		if(cur.val<x)
    		{
    			left.next=cur;
    			left=cur;
    		}
    		else
    		{
    			right.next=cur;
    			right=cur;
    		}
    	}
    	left.next=righthead.next;
    	right.next=null;
    	return lefthead.next;
    }
}