# Definition for singly-linked list. class(object): def__init__(self, x): self.val = x self.next = None
classSolution(object): defmergeKLists(self, lists): """ :type lists: List[ListNode] :rtype: ListNode """ res = [] for i in lists: while i: res.append(i.val) i = i.next res.sort() head = ListNode(0) p = head for i in res: t = ListNode(i) p.next = t p = p.next return head.next
defmain(): a = ListNode(1) a.next = ListNode(4) a.next.next = ListNode(5)
b = ListNode(1) b.next = ListNode(3) b.next.next = ListNode(4)
c = ListNode(2) c.next = ListNode(6)
l = [a, b, c]
s = Solution() head = s.mergeKLists(l) while head: print(head.val) head = head.next pass
近期评论