LeetCode 23. 合并K个升序链表

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """
        dummy=ListNode(0)
        node=dummy
        list=[]
        #把所有链表来连接起来
        for i in lists:
            while i:
                list.append(i.val)
                i=i.next
        list.sort()
        for i in list:
            node.next=ListNode(i)
            node=node.next
        return dummy.next