【leetcode 链表】148. Sort List C++

最新推荐文章于 2022-11-15 16:17:39 发布

笨比master

最新推荐文章于 2022-11-15 16:17:39 发布

阅读量65

点赞数

分类专栏： leetcode 文章标签：链表

本文链接：https://blog.csdn.net/m0_37454852/article/details/112385750

版权

leetcode 专栏收录该内容

288 篇文章 0 订阅

订阅专栏

148. Sort List

在这里插入图片描述

/**
 * 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* merge(ListNode* p, ListNode* q) {
        ListNode* newHead = new ListNode();
        ListNode* r = newHead;
        while(p && q) {
            if(p->val <= q->val) {
                r->next = p;
                p = p->next;
            }
            else {
                r->next = q;
                q = q->next;
            }
            r = r->next;
        }
        if(p) r->next = p;
        else r->next = q;
        return newHead->next;
    }
    ListNode* sortList(ListNode* head) {
        if(!head || !head->next) return head;
        ListNode *slow = head, *fast = head, *pre = nullptr;
        while(fast && fast->next) {
            pre = slow;
            slow = slow->next;
            fast = fast->next->next;
        }
        if(pre) pre->next = nullptr;
        head = sortList(head);
        slow = sortList(slow);
        return merge(head, slow);
    }
};