LC 148. 排序链表

归并排序，自定向下

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode sortList(ListNode head) {

        if (head == null || head.next == null) {
            return head;
        }
        ListNode slow = head, fast = head;
        while (fast.next != null && fast.next.next != null) {
            slow = slow.next;
            fast = fast.next.next;
        }
        fast = slow.next;
        slow.next = null;
        return merge(sortList(head), sortList(fast));
    }
    private ListNode merge(ListNode l1, ListNode l2) {
        ListNode sub = new ListNode(0);
        ListNode ptr = sub;
        while (l1 != null && l2 != null) {
            ListNode node = l1.val < l2.val ? l1 : l2;
            ptr = ptr.next = node;
            if (node == l1) {
                l1 = l1.next;
            } else {
                l2 = l2.next;
            }
        }
        ptr.next = l1 == null ? l2 : l1;
        return sub.next;
    }
}

class Solution {
public:
    ListNode* sortList(ListNode* head) {
        if (!head || !head->next) {return head;}
        auto slow = head, fast = head;
        while (fast->next && fast->next->next) {
            slow = slow->next;
            fast = fast->next->next;
        }
        fast = slow->next;
        slow->next = nullptr;
        return merge(sortList(head), sortList(fast));
    }
private:
    ListNode* merge(ListNode* l1, ListNode* l2) {
        ListNode sub(0), *ptr = ⊂
        while (l1 && l2) {
            auto& node = l1->val < l2->val ? l1 : l2;
            ptr = ptr->next = node;
            node = node->next;
        }
        ptr->next = l1 ? l1 : l2;
        return sub.next;
    }
};