148. Sort List

最新推荐文章于 2022-10-26 13:48:59 发布

转载最新推荐文章于 2022-10-26 13:48:59 发布 · 56 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/JTechRoad/p/9998889.html

本文介绍了一种基于递归的链表排序算法实现，通过将链表分成两半，分别排序后再进行合并，实现了链表的快速排序。文章详细解释了算法的各个步骤，包括寻找中间节点、递归排序和合并两个有序链表。

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

/**
 * 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) {
        return sortList(head, NULL);
    }
    ListNode* sortList(ListNode* head, ListNode* tail) {
        if (head == tail || head->next == tail) return head;
        ListNode *halfhead = middleList(head, tail);
        ListNode *h1 = sortList(head, halfhead);
        ListNode *h2 = sortList(halfhead, tail);
        return mergeList(h1, halfhead, h2, tail);
    }
    ListNode* middleList(ListNode* head, ListNode* tail) {
        ListNode *fast = head, *slow = head;
        while (fast != tail && fast->next != tail) {
            fast = fast->next->next;
            slow = slow->next;
        }
        return slow;
    }
    ListNode* mergeList(ListNode* h1, ListNode* t1, ListNode* h2, ListNode* t2) {
        ListNode h(0);
        ListNode *p = &h;
        while (h1 != t1 && h2 != t2) {
            if (h1->val > h2->val) {
                p->next = h2;
                h2 = h2->next;
            }
            else {
                p->next = h1;
                h1 = h1->next;
            }
            p = p->next;
        }
        while (h1 != t1) {
            p->next = h1;
            h1 = h1->next;
            p = p->next;
        }
        while (h2 != t2) {
            p->next = h2;
            h2 = h2->next;
            p = p->next;
        }
        p->next = t2;  // don't forget to set last node's next to t2
        return h.next;
    }
};

转载于:https://www.cnblogs.com/JTechRoad/p/9998889.html