給你一個鏈表數組，每個鏈表都已經按升序排列。請你將所有鏈表合并到一個升序鏈表中，返回合并后的鏈表。示例 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 = [[]] 輸出：[]

?

# 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:k = len(lists)if k == 0:return Noneinterval = 1while interval < k:for i in range(0, k, interval*2):if i + interval < k:lists[i] = self.mergeList(lists[i], lists[i + interval])interval *= 2return lists[0]def mergeList(self, l1, l2):dummpy = ListNode(0)cur = dummpywhile l1 != None or l2 != None:if l1 == None:cur.next = l2breakif l2 == None:cur.next = l1breakif l1.val < l2.val:cur.next = ListNode(l1.val)cur = cur.nextl1 = l1.nextelse:cur.next = ListNode(l2.val)cur = cur.nextl2 = l2.nextreturn dummpy.next

總結

以上是生活随笔為你收集整理的82. Leetcode 23. 合并K个升序链表 (排序)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。