[Python数据结构] 序列中n个最大最小集

最新推荐文章于 2026-06-19 17:00:49 发布

原创最新推荐文章于 2026-06-19 17:00:49 发布 · 835 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#python

PYTHON 专栏收录该内容

307 篇文章

订阅专栏

本文介绍了Python的heapq模块，展示了如何使用heapq.nlargest和heapq.nsmallest找到列表中的最大和最小元素。此外，还演示了如何根据价格对投资组合进行排序，并利用heapq.heapify创建堆以及通过heapq.heappop弹出堆顶元素。heapq模块在处理数据排序和优先级队列问题时非常实用。

>>> import heapq
>>> nums = [1, 8, 2, 23, 7, -4, 18, 23, 42, 37, 2]
>>> heapq.nlargest(3, a)
[5, 4, 3]
>>> heapq.nsmallest(3, a)
[1, 2, 3]
>>>
>>> portfolio = [
... {'name': 'IBM', 'shares': 100, 'price': 91.1},
... {'name': 'AAPL', 'shares': 50, 'price': 543.22},
... {'name': 'FB', 'shares': 200, 'price': 21.09},
... {'name': 'HPQ', 'shares': 35, 'price': 31.75},
... {'name': 'YHOO', 'shares': 45, 'price': 16.35},
... {'name': 'ACME', 'shares': 75, 'price': 115.65}
... ]
>>>
>>> heapq.nlargest(3, portfolio, key=lambda item: item['price'])
[{'name': 'AAPL', 'shares': 50, 'price': 543.22}, {'name': 'ACME', 'shares': 75, 'price': 115.65}, {'name': 'IBM', 'shares': 100, 'price': 91.1}]
>>>
>>> heapq.heapify(nums)
>>> nums
[-4, 2, 1, 23, 7, 2, 18, 23, 42, 37, 8]
>>> heapq.heappop(nums)
-4
>>> heapq.heappop(nums)
1
>>> heapq.heappop(nums)
2
>>> heapq.heappop(nums)
2
>>> heapq.heappop(nums)
7
>>> heapq.heappop(nums)
8
>>>