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.

题目分析：分别用两个链表再合并

/**
 * 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 less = new ListNode(0);
        ListNode more = new ListNode(0);
        ListNode lessHelp = less;
        ListNode moreHelp = more;
        while (head != null) {
            if (head.val < x) {
                less.next = new ListNode(head.val);
                less = less.next;
            } else {
                more.next = new ListNode(head.val);
                more = more.next;
            }
            head = head.next;
        }
        more.next = null;
        if (lessHelp.next != null) { 
            less.next = moreHelp.next;
            return lessHelp.next;
        } 
        return moreHelp.next;
    }
}