题目
【leetcode】023.合并K个有序链表
给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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
解法
解法1 分治法
class Solution:
def mergeKLists(self, lists: List[Optional[ListNode]]) -> Optional[ListNode]:
if len(lists)==0:
return None
return self.mergeInterval(lists, 0, len(lists)-1)
def mergeInterval(self, lists, left, right):
if right<left:
return
if right==left:
return lists[left]
if right==left+1:
return self.mergeTwo(lists[left], lists[right])
mid = (left+right)//2
la = self.mergeInterval(lists, left, mid-1)
lb = self.mergeInterval(lists, mid, right)
return self.mergeTwo(la, lb)
def mergeTwo(self, l, r):
if not l:
return r
if not r:
return l
if l.val <= r.val:
tmp = l.next
l.next = self.mergeTwo(tmp, r)
return l
else:
tmp = r.next
r.next = self.mergeTwo(l, tmp)
return r