Leetcode86

https://leetcode.com/problems/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

solution:
因为要求顺序不变，不能2 pointer swap swap
使用两个dummy node，将原linkedlist分成小于和不大于两部分，完成后，将smaller.next 指向larger的head，同时larger的tail指向空（这个非常重要）

public ListNode partition(ListNode head, int x) {
        ListNode smallerHead = new ListNode(0), fastHead = new ListNode(0);
        ListNode smallerCur = smallerHead, fastCur = fastHead;
        while (head != null) {
            if (head.val < x) {
                smallerCur.next = head;
                smallerCur = smallerCur.next;
            }
            else {
                fastCur.next = head;
                fastCur = fastCur.next;
            }
            head = head.next;
        }
        smallerCur.next = fastHead.next;
        fastCur.next = null;
        return smallerHead.next;
    }

复杂度：
Time： O(n)
Space: O(1)