list - Sort List_实现函数 sortlist(listnode<t>* head); template<typenam-优快云博客

本文介绍了一种使用常数空间复杂度实现的链表排序算法，该算法能够在O(nlogn)时间内完成排序。通过递归找到中间节点将链表分为两部分，再分别对这两部分进行排序，最后合并两个已排序的部分。

一，Sort List

题目描述

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

我的代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* getMiddleNodeOfList(ListNode* head){
        ListNode* slow = head;
        ListNode* fast = head;
        if(head == NULL){
            return NULL;
        }
        while(fast->next != NULL && fast->next->next != NULL) {
            slow = slow->next;
            fast = fast->next->next;
        }
        return slow;
    }

    ListNode* sortList(ListNode* head) {
        if(head == NULL || head->next == NULL) {
            return head;
        }
        ListNode *middle = getMiddleNodeOfList(head);
        ListNode *next   = middle->next;
        middle->next = NULL;
        return mergeList(sortList(head), sortList(next));
    }

    ListNode* mergeList(ListNode *list1, ListNode *list2){
        ListNode *head = new ListNode(-1);
        ListNode *p1, *p2, *pre = head;
        p1 = list1;
        p2 = list2;
        head->next = NULL;
        while(p1 != NULL && p2 != NULL){
            if(p1->val < p2->val){
                pre->next = p1;
                pre = p1;
                p1 = p1->next;
            } else {
                pre->next = p2;
                pre = p2;
                p2 = p2->next;
            }
        }
        if(p1 != NULL){
            pre->next = p1;
        }
        if(p2 != NULL){
            pre->next = p2;
        }
        return head->next;
    }
};