链表排序

快排：

class Solution {
public:
    ListNode* sortList(ListNode* head) {
        quick_sort(head, nullptr);
        return head;
    }
    void quick_sort(ListNode* head, ListNode* tail){
        if(!head || head == tail)
            return;
        ListNode* mid = partition(head, tail);
        quick_sort(head, mid);
        quick_sort(mid->next, tail);
    }
    ListNode* partition(ListNode* head, ListNode* tail){
        int privot = head->val;
        ListNode* left = head;
        ListNode* cur = head->next;
        while(cur && cur != tail){
            if(cur->val < privot){
                left = left->next;
                swap(left->val, cur->val);
            }
            cur = cur->next;
        }
        swap(head->val, left->val);
        return left;
    }
};

归并排序：

class Solution {
public:
    ListNode* sortList(ListNode* head) {
        if(!head || !head->next)
            return head;
        ListNode* slow = head, *fast = head, *pre = head;
        while(fast && fast->next){
            pre = slow;
            slow = slow->next;
            fast = fast->next->next;
        }
        pre->next = nullptr;
        return merge(sortList(head), sortList(slow));
    }
    ListNode* merge(ListNode* l1, ListNode* l2){
        ListNode* dummy = new ListNode(-1);
        ListNode* cur = dummy;
        while(l1 && l2){
            if(l1->val < l2->val){
                cur->next = l1;
                l1 = l1->next;
                cur = cur->next;
            }
            else{
                cur->next = l2;
                l2 = l2->next;
                cur = cur->next;
            }
        }
        if(l1)
            cur->next = l1;
        if(l2)
            cur->next = l2;
        return dummy->next;
    }
};