LeetCode 86 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; }
 * }
 */
class Solution {
    public ListNode partition(ListNode head, int x) {
        ListNode dummy1 = new ListNode(0);
        ListNode dummy2 = new ListNode(0);
        //用两个队列，一个储存小于x的
        ListNode cur1 = dummy1;
        //储存大于等于x的
        ListNode cur2 = dummy2;
        
        while(head != null){
            if(head.val < x){
                cur1.next = head;
                cur1 = head;
            }
            else{
                cur2.next = head;
                cur2 = head;
            }
            head = head.next;
        }
        //防止circle
        cur2.next = null;
        //连上d1 d2
        cur1.next = dummy2.next;
        return dummy1.next;
        
    }
}