题解 | #合并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:
        # write code here
		# it would be much easier to use list to understand the problem
		# So we first store the val in ListNode into a list and sort it
        l = []
        for head in lists:
            sub = head
            while sub:
                l.append(sub.val)
                sub = sub.next
        l.sort()
        
        ans = ListNode(0)
        current = ans
        for i in l:
            current.next = ListNode(i)
            current = current.next
        return ans.next