leetcode+链表上的归并排序

最新推荐文章于 2022-07-02 00:16:42 发布

小堃哥

最新推荐文章于 2022-07-02 00:16:42 发布

阅读量294

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u013554860/article/details/79824968

版权

Leetcode 专栏收录该内容

450 篇文章 0 订阅

订阅专栏

点击打开链接

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
    public:
    //链表上的排序合并
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2)
    {
        if(l1==NULL) return l2;
        if(l2==NULL) return l1;
        ListNode *dummy_head = new ListNode(-1);
        ListNode *tail = dummy_head;
        while (l1!=NULL && l2!=NULL) {
            if(l1->val < l2->val){
                tail->next =l1;
                l1=l1->next;
            }
            else{
                tail ->next =l2;
                l2= l2->next;
            }
            tail = tail ->next;
            tail->next = NULL;
        }
        if(l1!=NULL){
            tail->next =l1;
        }
        if(l2!=NULL){
            tail->next = l2;
        }
        return dummy_head->next;
        
    }
    ListNode* sortList(ListNode* head) {
        if(head==NULL || head->next == NULL){
            return head;
        }
        ListNode *slow =head, *fast =head;
        while (slow!=NULL&& fast!=NULL && fast->next!=NULL) {
            slow =slow->next;
            fast = fast->next->next;
        }
        ListNode *midnext = slow->next;
        slow->next = NULL;
        ListNode *l1 = sortList(head);
        ListNode *l2 = sortList(midnext);
        return mergeTwoLists(l1, l2);
    }
};
int main()
{
    
    return 0;
}