23.md

题目地址

https://leetcode-cn.com/problems/merge-k-sorted-lists/

解答

def mergeKLists(lists):
    """
        合并K个排序链表

        res为头节点
        如果l.next不为none，则取值，放入temp
        然后排序temp
        创建链表, 返回res
    """
    a = []
    b = ListNode(0)
    c = b
    for i in lists:
        while i:
            a.append(i.val)
            i = i.next
    a.sort()
    for j in a:
        c.next = ListNode(j)
        c = c.next
    return (b.next)