23. Merge k Sorted Lists***

最新推荐文章于 2021-12-08 15:59:42 发布

Yingying_code

最新推荐文章于 2021-12-08 15:59:42 发布

阅读量248

点赞数

分类专栏： leetcode Java heap

本文链接：https://blog.csdn.net/alwaystry/article/details/54974375

版权

leetcode 同时被 3 个专栏收录

261 篇文章 0 订阅

订阅专栏

Java

188 篇文章 0 订阅

订阅专栏

heap

7 篇文章 0 订阅

订阅专栏

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

My code:

public class Solution {
    public ListNode mergeKLists(ListNode[] lists) {
        PriorityQueue<ListNode> queue = new PriorityQueue<>((a,b)->a.val-b.val);
        int k = lists.length;
        for(int i=0; i<k; i++){
            if(lists[i]!=null) queue.offer(lists[i]);
        } 
        ListNode dummy = new ListNode(0);
        ListNode cur = null;
        cur = dummy;
        while(!queue.isEmpty()){
            cur.next = queue.poll();
            cur = cur.next;
            if(cur.next!=null){
                queue.offer(cur.next);
            }
        }
        return dummy.next;
        
    }
}

总结：完美，学了lambda表达式，现学现卖。用了进去很好用呀。

另外一种重载方式：

PriorityQueue<ListNode> queue= new PriorityQueue<ListNode>(lists.size(),new Comparator<ListNode>(){
            @Override
            public int compare(ListNode o1,ListNode o2){
                if (o1.val<o2.val)
                    return -1;
                else if (o1.val==o2.val)
                    return 0;
                else 
                    return 1;
            }
        });