leetcode23 Merge k Sorted Lists

最新推荐文章于 2024-01-18 20:36:48 发布

Boyce_L

最新推荐文章于 2024-01-18 20:36:48 发布

阅读量331

点赞数

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

本文链接：https://blog.csdn.net/alxandral_brother/article/details/77937685

版权

leetcode 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

题目leetcode23 Merge k Sorted Lists
难度等级:hard

思路

就是多路归并，注意判断某一路为空时候的处理就可以了

实现

class Solution {
public:
    ListNode* mergeKLists(vector<ListNode*>& lists) {
        int k = lists.size();

        if(k == 0) return NULL;

        ListNode * ret = NULL, * copy = NULL, * current[k];
        for(int i = 0; i < k; i++){
            current[i] = lists[i];
        }

        bool first = true;
        while(true) {
            // choose the smallest one
            int min = 2147483647, index = -1;
            for(int i = 0; i < k; i++)
                if(current[i] != NULL && current[i]->val <= min){
                    min = current[i]->val;
                    index = i;
                }

            if(index == -1)
                break;

            current[index] = current[index]->next;

            if(first) {
                ret = new ListNode(min);
                copy = ret;
                first = false;
            } else {
                copy->next = new ListNode(min);
                copy = copy->next;
            }

        }

        return ret;
    }
};