LeetCode 148 - Sort List

Sort a linked list in O(n log n) time using constant space complexity.

Solution:

Use merge sort.

private ListNode h; //保存当前要访问的节点（不一定是链表的头部）
public ListNode sortList(ListNode head) {
    if(head==null || head.next==null) return head;
    h = head;
    int size = 0;
    while(head != null) {
        size++;
        head = head.next;
    }
    return mergesort(size);
}

private ListNode mergesort(int size) {
    if(size == 1) {
        ListNode head = h;
        h = h.next;
        head.next = null;
        return head;
    }
    ListNode l = mergesort(size/2);
    ListNode r = mergesort(size-size/2);
    return merge(l,r);
}

private ListNode merge(ListNode l, ListNode r) {
    ListNode dummy = new ListNode(0);
    ListNode n = dummy;
    while(l!=null && r!=null) {
        if(l.val < r.val) {
            n.next = l;
            l = l.next;
        } else {
            n.next = r;
            r = r.next;
        }
        n = n.next;
    }
    n.next = l!=null ? l : r;
    return dummy.next;
}