148. Sort List（链表归并排序）

最新推荐文章于 2024-04-25 00:13:48 发布

Vincentywj

最新推荐文章于 2024-04-25 00:13:48 发布

阅读量342

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/Vincentywj/article/details/89390748

LeetCode 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种使用常数空间复杂度，在O(nlogn)时间内对链表进行排序的算法。通过递归将链表分为两半，然后分别对两半进行排序，最后将两个已排序的链表合并为一个有序链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class Solution {
public:
    ListNode *sortList(ListNode *head) {
        if(head == NULL || head->next == NULL) {
            return head;
        }
        ListNode * slow = head;
        ListNode * fast = head;
        while(slow->next != NULL && fast->next->next != NULL) {
            slow = slow->next;
            fast = fast->next->next;
        }
        ListNode * mid = slow->next;
        slow->next = NULL;
        head = sortList(head);
        mid = sortList(mid);
        return merge(head, mid);
    }
    ListNode *merge(ListNode *headone, ListNode *headtwo) {
        if(headone == NULL) 
            return headtwo;
        if(headtwo == NULL) 
            return headone;
        ListNode * headnew = new ListNode(-1);
        ListNode * last = headnew;
        while(headone != NULL && headtwo != NULL) {
            if(headone->val < headtwo->val) {
                last->next = headone;
                headone = headone->next;
            }else {
                last->next = headtwo;
                headtwo = headtwo->next;
            }
            last = last->next;
        }
        if(headone == NULL) {
            last->next = headtwo;
        }
        if(headtwo == NULL) {
            last->next = headone;
        }
        return headnew->next;
    }
};