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.

Example:

Input: head = 1->4->3->2->5->2, x = 3
Output: 1->2->2->4->3->5

思路
此题的任务是划分链表，比x小的链表节点都出现在比x大或者等于的节点前面，而且还要保持原来的相对位置不要发生变化。我们新建两个链表了l1,l2，遍历原来的链表 ，把值小于x的节点都加入l1,把值大于或者等于x的节点都加入l2，最后将l2连接至l1的后面，所得的链表就是我们所求的结果了。

注意点就是最后将第二个链表末尾置空，不然形成环

/**
 * 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);
        
        ListNode small = dummy1;
        ListNode large = dummy2;
        
        while(head != null){
            if(head.val < x){
                small.next= head;
                small =small.next;
            }
            else{
                large.next = head;
                large =large.next;
            }
            
            head = head.next;
        }
        
        large.next = null;
        small.next = dummy2.next;
        return dummy1.next;
    }
}```