LeetCode 23. 合并 K 个升序链表

LeetCode 23. 合并 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

# 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[Optional[ListNode]]) -> Optional[ListNode]:
        # res = None
        # for i in range(len(lists)):
        #     res = self.merge2Lists(res, lists[i])
        # return res

		# 分治
        if not lists:
            return None
        q = deque(lists)
        while len(q) > 1:
            q.append(self.merge2Lists(q.popleft(), q.popleft()))
        return q.popleft()

    def merge2Lists(
        self, l1: Optional[ListNode], l2: Optional[ListNode]
    ) -> Optional[ListNode]:
        if l1 is None or l2 is None:
            return l1 or l2
        head = p = ListNode()
        p1, p2 = l1, l2
        while p1 and p2:
            while p2 and p2.val < p1.val:
                p.next = p2
                p = p.next
                p2 = p2.next
            p.next = p1
            p = p.next
            p1 = p1.next
        p.next = p1 or p2
        return head.next