题解 | #合并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
        cur_nodes = [node for node in lists if node != None]
        cur_val = [node.val for node in cur_nodes]
        res = ListNode(0)
        cur = res
        while cur_nodes != []:
            min_val = min(cur_val)
            index = cur_val.index(min_val)
            cur.next = cur_nodes[index]
            cur = cur.next
            if cur_nodes[index].next != None:
                cur_nodes[index] = cur_nodes[index].next
                cur_val[index] = cur_nodes[index].val
            else:
                cur_nodes.pop(index)
                cur_val.pop(index)
        return res.next