合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
示例:
输入:
[
1->4->5,
1->3->4,
2->6
]
输出: 1->1->2->3->4->4->5->6
import heapq
class Solution:
def mergeKLists(self, lists: List[ListNode]) -> ListNode:
dummy = ListNode(0)
tail = dummy
heap = []
for i in range(len(lists)):
if not lists[i]:
continue
heapq.heappush(heap, (lists[i].val, i))
lists[i] = lists[i].next
while heap:
val, i = heapq.heappop(heap)
tail.next = ListNode(val)
tail = tail.next
if lists[i]:
heapq.heappush(heap, (lists[i].val, i))
lists[i] = lists[i].next
return dummy.next