/**
* 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) {
if(head == nullptr || head->next == nullptr){
return head;
}
ListNode* slow = head;
ListNode* fast = head;
ListNode* pre = nullptr;
while(fast && fast->next){
pre = slow;
fast = fast->next->next;
slow = slow->next;
}
pre->next = nullptr;
ListNode* left = sortList(head);
ListNode* right = sortList(slow);
return mergeSort(left, right);
}
ListNode* mergeSort(ListNode* l1, ListNode* l2){
if(l1 == nullptr) return l2;
if(l2 == nullptr) return l1;
if(l1->val < l2->val){
l1->next = mergeSort(l1->next, l2);
return l1;
}else{
l2->next = mergeSort(l1, l2->next);
return l2;
}
}
};
【归并排序】148. 排序链表
最新推荐文章于 2024-07-21 08:37:44 发布