![5be4a051892d55edd8f6233419b45ed8.png](https://img-blog.csdnimg.cn/img_convert/5be4a051892d55edd8f6233419b45ed8.png)
给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 1:
输入:lists = [[1,4,5],[1,3,4],[2,6]]
输出:[1,1,2,3,4,4,5,6]
解释:链表数组如下:
[
1->4->5,
1->3->4,
2->6
]
将它们合并到一个有序链表中得到。
1->1->2->3->4->4->5->6
示例 2:
输入:lists = []
输出:[]
示例 3:
输入:lists = [[]]
输出:[]
提示:
k == lists.length
0 <= k <= 10^4
0 <= lists[i].length <= 500
-10^4 <= lists[i][j] <= 10^4
lists[i]
按 升序 排列lists[i].length
的总和不超过10^4
#
# @lc app=leetcode.cn id=23 lang=python3
#
# [23] 合并K个升序链表
#
# @lc code=start
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def mergeKLists(self, lists: List[ListNode]) -> ListNode:
import queue
q = queue.PriorityQueue()
head = ListNode()
p = head
cnt = 0
for node in lists:
if node:
cnt+=1
q.put((node.val,cnt,node))
while(not q.empty()):
val, tmp, node = q.get()
p.next = ListNode(val)
p=p.next
node=node.next
if node:
cnt+=1
q.put((node.val, cnt, node))
return head.next
# @lc code=end