题解 | #合并k个已排序的链表#

# class ListNode:

# from numpy import sort
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param lists ListNode类一维数组 
# @return ListNode类
#
class Solution:
    def mergeKLists(self , lists: List[ListNode]) -> ListNode:
        a = []
        for i in range(len(lists)):
            tmp = lists[i]
            while tmp != None:
                a.append(tmp.val)
                tmp = tmp.next
        

        a = sorted(a)
        newL = ListNode(-1) # 创建一个新的链表头指针
        res = newL
        for i in a:
            newL.next = ListNode(i)
            newL = newL.next

        newL.next = None
        return res.next # 指向下一个