LeetCode 148. Sort List

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

David_DLUT

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

阅读量169

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/David_DLUT/article/details/53941508

版权

LeetCode 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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* sortList(ListNode *head) {
        if (head == NULL) {
            return head;
        }
        int n = 0;
        ListNode *temp = head;
        while (temp != NULL) {
            temp = temp->next;
            ++n;
        }
        return mergeSort(head, n);
    }
private:
    ListNode* mergeSort(ListNode *head, int n) {
        if (n == 1) {
            head->next = NULL;
            return head;
        }
        int k = n / 2;
        ListNode *mid = head;
        for (int i = 0; i < k; ++i) {
            mid = mid->next;
        }
        ListNode *sort_pre = mergeSort(head, k);
        ListNode *sort_next = mergeSort(mid, n - k);
        ListNode dummy(0);
        ListNode *tail = &dummy;
        while ((sort_pre != NULL) && (sort_next != NULL)) {
            if (sort_pre->val < sort_next->val) {
                tail->next = sort_pre;
                tail = sort_pre;
                sort_pre = sort_pre->next;
            }
            else {
                tail->next = sort_next;
                tail = sort_next;
                sort_next = sort_next->next;
            }
        }
        tail->next = (sort_pre != NULL) ? sort_pre : sort_next;
        return dummy.next;
    }
};