[LeetCode] Merge k Sorted List (priority queue, min heap, comparator)

Seth_Lin

于 2015-04-01 13:13:44 发布

阅读量554

点赞数

CC 4.0 BY-SA版权

分类专栏：面试题目们

本文链接：https://blog.youkuaiyun.com/craiglin1992/article/details/44805493

面试题目们专栏收录该内容

48 篇文章

订阅专栏

本文介绍了一种使用优先队列合并K个已排序链表的方法。通过自定义比较器，将链表节点按值排序并依次加入优先队列中。每次从队列中取出最小值节点，并将其下一个节点再次加入队列，直至队列为空。

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

public class Solution {
    public ListNode mergeKLists(List<ListNode> lists) {
        if(lists == null || lists.size() == 0) {
            return null;
        }
        PriorityQueue<ListNode> q = new PriorityQueue<ListNode> (lists.size(), new Comparator<ListNode>() {
            @Override
            public int compare(ListNode a, ListNode b) {
                return Integer.compare(a.val, b.val);
            }
        });

        ListNode head = new ListNode(0);//remove the hassel of some coner cases
        ListNode cur = head;
        //add the 1st node of each list to initialize it
        for(ListNode l : lists) {
            if(l != null) { //in case lists size is not 0 but only contains nulls
                q.add(l);
            }
        }
        while(!q.isEmpty()) {
            ListNode temp = q.poll();
            cur.next = temp;
            //keep adding the next node in the list
            if(temp.next != null){
                q.add(temp.next);
            }
            cur = cur.next;
        }
        return head.next;
    }
}