148. 排序链表

class Solution {
    public ListNode sortList(ListNode head) {
        if (head == null || head.next == null) {
            return head;
        }
        ListNode slow = head, fast = head.next;
        if (fast.next == null) {
            if (slow.val > fast.val) {
                int tmp = slow.val;
                slow.val = fast.val;
                fast.val = tmp;
            }
            return head;
        }
        while (fast != null) {
            fast = fast.next;
            if (fast != null) {
                fast = fast.next;
            }
            slow = slow.next;
        }
        ListNode head2 = slow.next, nh1, nh2;
        slow.next = null;
        nh1 = sortList(head);
        nh2 = sortList(head2);
        return merge(nh1, nh2);
    }

    private ListNode merge(ListNode l1, ListNode l2) {
        if (l1 == null) {
            return l2;
        }
        if (l2 == null) {
            return l1;
        }
        ListNode root = new ListNode(), tail = root, tmp;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                tmp = l1;
                l1 = l1.next;
            } else {
                tmp = l2;
                l2 = l2.next;
            }
            tmp.next = null;
            tail.next = tmp;
            tail = tmp;
        }
        if (l1 != null) {
            tail.next = l1;
        }
        if (l2 != null) {
            tail.next = l2;
        }
        return root.next;
    }
}