merge k sorted lists

最新推荐文章于 2021-04-05 17:06:29 发布

置顶鹏割

最新推荐文章于 2021-04-05 17:06:29 发布

阅读量398

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/nizhannizhan/article/details/51108584

leetcode 专栏收录该内容

31 篇文章

订阅专栏

本文深入探讨了合并K个已排序链表并返回排序结果的算法实现，通过逐步分析代码，理解其复杂度及工作原理。

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

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

class Solution
{
  public:
    ListNode* mergeKLists(vector<ListNode*> &lists)
    {
        if (lists.size() == 0)
         return NULL;
        ListNode* p = lists[0];
        for (int i = 1; i < lists.size(); i++)
        {
            p = mergeTwoLists(p,lists[i]);
        }

        return p;
    }


    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2)
    {
        if (l1 == NULL)
            return l2;
        if (l2 == NULL)
            return l1;
        ListNode dummy(-1);
        ListNode* p = &dummy;
        if (l1->val < l2->val)
        {
            p->next = l1;
            p = p->next;
            p->next = mergeTwoLists(p->next,l2);
        }
        else
        {
            p->next = l2;
            p = p->next;
            p->next = mergeTwoLists(l1,p->next);
        }

        return dummy.next;
    }
};