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

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