题目链接
题目描述
给定一个链表数组,每个链表都已经按升序排列。
请将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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
解题思路
分治+归并排序
代码
Python
class Solution:
def mergeKLists(self, lists: list[ListNode]) -> ListNode:
def mergeTwoList(A: ListNode, B: ListNode) -> ListNode:
dummy = ListNode()
cur = dummy
while A and B:
if A.val < B.val:
cur.next = A
A = A.next
else:
cur.next = B
B = B.next
cur = cur.next
if A:
cur.next = A
else:
cur.next = B
return dummy.next
def merge(lists: list[ListNode], l: int, r: int) -> ListNode:
if l == r:
return lists[l]
if l > r:
return None
mid = (l + r) >> 1
return mergeTwoList(merge(lists, l, mid), merge(lists, mid + 1, r))
return merge(lists, 0, len(lists) - 1)