Python heapq All In One

Python heapq All In One

heapq — Heap queue algorithm / 堆队列算法

import heapq

https://docs.python.org/3/library/heapq.html

heapq vs Priority Queue

堆队列 vs 优先队列

# ?

Queue.PriorityQueue is a thread-safe class, while the heapq module makes no thread-safety guarantees.

https://stackoverflow.com/questions/36991716/whats-the-difference-between-heapq-and-priorityqueue-in-python

https://docs.python.org/3/library/queue.html#queue.PriorityQueue
https://docs.python.org/zh-cn/3/library/queue.html#queue.PriorityQueue

https://docs.python.org/2/library/queue.html
https://docs.python.org/zh-cn/2/library/heapq.html

demos

class Solution:
    def findMaximizedCapital( self, k: int, w: int, profits: List[int], capital: List[int]) -> int:
        n = len(profits)
        projects = [(capital[i], profits[i]) for i in range(n)]
        projects.sort()
        maxHeap = []
        i = 0
        for _ in range(k):
            while i < n and projects[i][0] <= w:
                heapq.heappush(maxHeap, -projects[i][1])
                i += 1
            if not maxHeap:
                break
            w -= heapq.heappop(maxHeap)
        return w

https://leetcode.com/problems/ipo/solutions/5315041/easy-to-understand-fast-maxheap-sorting/?envType=daily-question&envId=2024-06-15

(🐞 反爬虫测试！打击盗版⚠️）如果你看到这个信息, 说明这是一篇剽窃的文章，请访问 https://www.cnblogs.com/xgqfrms/ 查看原创文章！

LeetCode 502 IPO

https://www.cnblogs.com/xgqfrms/p/18253514

refs

https://www.cnblogs.com/xgqfrms/p/18256599#5279542

---

---

©xgqfrms 2012-2021

www.cnblogs.com/xgqfrms 发布文章使用：只允许注册用户才可以访问！

原创文章，版权所有©️xgqfrms, 禁止转载 🈲️，侵权必究⚠️！

---