题解 | #合并k个已排序的链表#
合并k个已排序的链表
https://www.nowcoder.com/practice/65cfde9e5b9b4cf2b6bafa5f3ef33fa6
# 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
# 解法1，用数组存储排序
temp = []
for i in lists:
while i:
temp.append(i.val)
i = i.next
if not temp:
return None
result = ListNode(-1)
cur = result
temp.sort()
for i in range(len(temp)):
cur.next = ListNode(temp[i])
cur = cur.next
return result.next
用数组存储数据，排序后再用链表输出
