148. Sort List

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

分析：

归并排序，考虑链表和数组的区别，链表每次划分为两段链表，然后有序链表归并。可以复用21. Merge Two Sorted Lists代码。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* sortList(ListNode* head) {
        if (head == NULL || head->next == NULL) return head;

        ListNode* head1 = head;
        ListNode* head2 = getMid(head);
        head1 = sortList(head1);
        head2 = sortList(head2);
        return mergeTwoLists(head1, head2);
    }

    ListNode* getMid(ListNode* head) {
        ListNode *slow = head, *fast = head, *prev = head;
        while (fast && fast->next) {
            prev = slow;
            slow = slow->next;
            fast = fast->next->next;
        }

        prev->next = NULL; // cut at middle

        return slow;
    }

    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode dummy(-1);
        ListNode *cur = &dummy;

        while (l1 != NULL && l2 != NULL) {
            if (l1->val < l2->val) {
                cur->next = l1;
                l1 = l1->next;
            }
            else {
                cur->next = l2;
                l2 = l2->next;
            }

            cur = cur->next;
        }

        while (l1 != NULL) {
            cur->next = l1;
            l1 = l1->next;
            cur = cur->next;
        }

        while (l2 != NULL) {
            cur->next = l2;
            l2 = l2->next;
            cur = cur->next;
        }

        return dummy.next;
    }
};