Leetcode刻意练习----数组6
题目
合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
示例
输入:
[
1->4->5,
1->3->4,
2->6
]
输出: 1->1->2->3->4->4->5->6
题解
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeKLists(self, lists: List[ListNode]) -> ListNode:
a = ListNode(0)
b = a
c = []
for i in lists:
while i != None:
c.append(i.val)
i = i.next
c.sort()
for n in c:
b.next = ListNode(n)
b = b.next
return a.next