LeetCode之旅（4）

Sort List

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

链表排序，根据题目要求，使用归并最好。

不得不吐槽一下，用python做这种细致的链表操作真的很烦，我还不能很熟练的运用也是一个原因吧

各种蛋疼，而且最终效率还不高，所以也吸取了教训：这类题还是c/c++的顺手

/**
 * 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) return head;
        ListNode *tail = head, *res;
        int size = 0;
        for (; tail!= NULL; tail = tail->next, size++);
        res = MergeSort(head, tail, size);
        return res;
    }
    ListNode *MergeSort(ListNode *l, ListNode *r, int size) {
        if (l->next == r) return l;
        ListNode *m = l;
        for (int i = 0; i < size / 2; i++, m = m->next);
        ListNode *lp = MergeSort(l, m, size / 2);
        ListNode *rp = MergeSort(m, r, size - size / 2);
        ListNode *s, *h;
        if (lp->val > rp->val)
            h = s = rp, rp = rp->next;
        else
            h = s = lp, lp = lp->next;
        for (int i = 1; i < size; i++) {
            if (rp == r || (lp !=m && lp->val < rp->val))
                s->next = lp, lp = lp->next;
            else
                s->next = rp, rp = rp->next;
            s = s->next;
        }
        s->next = r;
        return h;
    }
};