23. Merge k Sorted Lists python leetcode 2016 new Season

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.


use priority queue will take O(n) time cause get max from priority will only take O(1)


# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

from Queue import PriorityQueue
class Solution(object):
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """
        dummyHead = ListNode(None)
        currentNode = dummyHead
        queue = PriorityQueue()
        for list_ in lists:
            if list_:
                queue.put((list_.val, list_))
        while queue.qsize():
             node = queue.get()[1]
             currentNode.next = node
             currentNode = currentNode.next
             if node.next:
                 queue.put((node.next.val, node.next))
        return dummyHead.next


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值