Leetcode 148.排序链表

最新推荐文章于 2024-02-20 16:29:23 发布

LHY08005

最新推荐文章于 2024-02-20 16:29:23 发布

阅读量55

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/LHY08005/article/details/115567893

版权

leetcode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* sortList(ListNode* head) {
        return sortList(head, nullptr);
    }
    ListNode* sortList(ListNode* head, ListNode* tail) {
        if (head == nullptr) return head;
        if (head->next == tail) {
            head->next = nullptr;
            return head;
        }
        ListNode* slow = head, *fast = head;
        while (fast != tail) {
            slow = slow->next;
            fast = fast->next;
            if (fast != tail) fast = fast->next;
        }
        ListNode* mid = slow;
        return merge(sortList(head, mid), sortList(mid, tail));
    }
    ListNode* merge(ListNode* head1, ListNode* head2) {
        ListNode* dummyHead = new ListNode(0);
        ListNode* pHead = dummyHead;
        while (head1 != nullptr && head2 != nullptr) {
            if (head1->val <= head2->val) {
                pHead->next = head1;
                head1 = head1->next;
            }
            else {
                pHead->next = head2;
                head2 = head2->next;
            }
            pHead = pHead->next;
        }
        if (head1) pHead->next = head1;
        else if (head2) pHead->next = head2;
        return dummyHead->next;
    }
};