merge-k-sorted-lists

最新推荐文章于 2026-04-04 23:23:01 发布

原创最新推荐文章于 2026-04-04 23:23:01 发布 · 351 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 同时被 2 个专栏收录

27 篇文章

订阅专栏

算法总结

3 篇文章

订阅专栏

博客围绕合并k个有序链表展开，提出将其合并为一个有序链表的问题，并给出两两比较的解决思路，还提及会给出相应代码。

题目描述

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

思路

两两进行比较

代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *mergeKLists(vector<ListNode *> &lists) {
        if(lists.size() == 0)
            return nullptr;
        if(lists.size() == 1)
            return lists[0];
        ListNode *pFirst = lists[0];
        
        for(int i = 1; i<lists.size();i++)
        {
            ListNode *pSecond = lists[i];
            ListNode *dummy = new ListNode(0);
            ListNode *ptr = dummy;
            while(pFirst && pSecond)
            {
                if(pFirst->val < pSecond->val)
                {
                    ptr->next = pFirst;
                    pFirst = pFirst->next;
                }
                else
                {
                    ptr->next = pSecond;
                    pSecond = pSecond->next;
                }
                ptr = ptr->next;
            }
            
            ListNode *rest = pFirst?pFirst:pSecond;
            if(rest)
            {
                ptr->next = rest;
            }
            pFirst = dummy->next;
            delete dummy;
        }
        
        return pFirst;
        
    }
};