题目地址:Merge k Sorted Lists - LeetCode
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
Example:
Input:
[
1->4->5,
1->3->4,
2->6
]
Output: 1->1->2->3->4->4->5->6
这道题目是经典的对K个有序链表进行合并,可以使用最小堆或者说优先队列。
如果采用暴力的方法,也就是把所有节点加入数组,排序,那么时间复杂度是O(NlogN)。
采用最小堆的时间复杂度是O(NlogK)。
Python解法如下:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
from queue import PriorityQueue
class Solution:
def mergeKLists(self, lists: list) -> ListNode:
dummy = ListNode(None)
curr = dummy
q = PriorityQueue()
<