Leetcode:Partition List

Partition 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.

解析：先找到第一个比x大的节点，然后把后面比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) {
        
        if(head==null||head.next==null)return head;
        
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode left = dummy;
        ListNode right = head;
        
        while(right!=null)
        {
            if(right.val>=x)
                break;
            left = left.next;
            right = right.next;
        }
        
        ListNode curr1 = left;
        ListNode curr2 = right;
        
        while(curr2!=null)
        {
            if(curr2.val<x)
            {
                curr1.next = curr2.next;
                left.next = curr2;
                curr2.next = right;
                left = left.next;
                curr2 = curr1.next;
            }
            else
            {
                curr2 = curr2.next;
                curr1 = curr1.next;
            }
        }
        
        return dummy.next;
    }
}