【python-leetcode23-多路归并】合并k个排序链表

# Definition for singly-linked list.
# class ListNode:     def __init__(self,x):         self.val = x         self.next = None

class Solution:
    def mergeKLists(self,lists: List[ListNode]) -> ListNode:
        while len(lists)>1:
            a=lists.pop() if len(lists)>0 else None
            b=lists.pop()  None
            lists.insert(0,self.mergeTwoLists(a,b))
        return None if len(lists)<1  lists[0]
    def mergeTwoLists(self,l1,l2):
        newHead=ListNode(0)
        t=newHead
        while l1 and l2:
            if l1.val<=l2.val:
                t.next=ListNode(l1.val)
                l1=l1.next
            :
                t.next=ListNode(l2.val)
                l2=l2.next
            t=t.next
        if l1:
            t.next=l1
         l2:
            t.next=l2
        return newHead.next