leetcode刷题-23.Merge K Sorted Lists

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

Input:
[
1->4->5,
1->3->4,
2->6
]
Output: 1->1->2->3->4->4->5->6

合并k个有序列表,我采用的是优先级队列(PriorityQueue),将所有列表放入PriorityQueue中，然后类似宽度优先搜索，取出最小的，如果该链表的next不为空，将next加入到优先级队列中

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    private Comparator<ListNode> ListNodeComporator = new Comparator<ListNode>() {
        public int compare(ListNode left, ListNode right) {
            return left.val - right.val;
        }
    };
    
    public ListNode mergeKLists(ListNode[] lists) {
    	//边界处理
        if (lists == null || lists.length == 0) {
            return null;
        }
        //将List放入PriorityQueue
        Queue<ListNode> heap = new PriorityQueue<>(lists.length, ListNodeComporator);
        for (int i = 0; i < lists.length; i++) {
            if (lists[i] != null) {
                heap.offer(lists[i]);
            }
        }
        
        ListNode dummy = new ListNode(0);
        ListNode tail = dummy;
        
        while(!heap.isEmpty()) {
        	//取出当前最小
            ListNode node = heap.poll();
            //构建结果列表
            tail.next = node;
            tail = tail.next;
            //将最小node的next加入PriorityQueue
            if (node.next != null) {
                heap.offer(node.next);
            }
        }
        return dummy.next;
    }
}