力扣23合并k个排序链表

不用堆排序，分治可以做到O(1)空间 复杂度

class Solution:
    def mergeKLists(self, lists: List[ListNode]) -> ListNode:
        # k个链表两两合并一次变成k/2个链表，
        # 然后再两两合并一次变成k/4个链表。。。合并logk次到只有一个链表
        # 每次合并都是需要n个结点遍历，故O(Nlogk),空间复杂度为O(1)
        if not lists: return
        # [[],[1]] 所以不能用not list[0]: return 应该返回[1]的，而非None
        if len(lists) == 1 and not lists[0]: return
        # 下面的直接背过
        amount = len(lists)
        interval = 1
        while interval < amount:
            for i in range(0, amount - interval, interval * 2):
                lists[i] = self.mergeTwoLists(lists[i], lists[i + interval])
            interval *= 2
        return lists[0]

    def mergeTwoLists(self,l1, l2):
        if not l1: return l2
        if not l2: return l1
        if l1.val < l2.val:
            l1.next = self.mergeTwoLists(l1.next, l2)
            return l1
        else:
            l2.next = self.mergeTwoLists(l1, l2.next)
            return l2