【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

public class ListNode {
    int val;
    ListNode next;
    ListNode(int x) { val = x; }
}
public class num86 {
    public static ListNode partition(ListNode head, int x) {
       ListNode before_head = new ListNode(0);
       ListNode before = before_head;
       ListNode after_head = new ListNode(0);
       ListNode after = after_head;
       while(head!=null){
            if(head.val<x){
                before.next = head;
                before = before.next;
            }else{
                after.next = head;
                after = after.next;
            }
            head = head.next;
       }
       after.next = null;
       before.next = after_head.next;
       return before_head.next;
    }
    public static void main(String[] args) {
        ListNode head = new ListNode(1);
        head.next = new ListNode(4);
        head.next.next = new ListNode(3);
        head.next.next.next = new ListNode(2);
        head.next.next.next.next = new ListNode(5);
        head.next.next.next.next.next = new ListNode(2);
        ListNode root = partition(head, 3);
        while(root!=null){
            System.out.println(root.val);
            root = root.next;
        }
    }
}

开辟两个新的链表头将小于x的加入到before list中，否则加入到after list 中，最后将两个链表链接。