题解 | #合并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:
num = len(lists)
List = []
for i in range(num):
p= lists[i]
while p:
List.append(p.val)
p=p.next
List.sort()
ans=phead=ListNode(0)
for i in List:
phead.next = ListNode(0)
phead=phead.next
phead.val=i
return ans.next
# write code here
疯狂刷题专栏 文章被收录于专栏
只要刷不死，就往死里刷-
