python学习数据结构heapq

最新推荐文章于 2024-11-01 09:33:51 发布

qq_36173508

最新推荐文章于 2024-11-01 09:33:51 发布

阅读量185

点赞数

分类专栏： python数据结构文章标签： python

本文链接：https://blog.csdn.net/qq_36173508/article/details/78924242

版权

python数据结构专栏收录该内容

1 篇文章 0 订阅

订阅专栏

>>> import heapq
>>> nums = [1, 8, 2, 23, 7, -4, 18, 23, 42, 37, 2]
>>> print(heapq.nlargest(3, nums)) # Prints [42, 37, 23]
[42, 37, 23]
>>> print(heapq.nsmallest(3, nums)) # Prints [-4, 1, 2]
[-4, 1, 2]
>>>
>>>
>>>
>>>
>>>
>>> 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}
... ]
>>> cheap = heapq.nsmallest(3, portfolio, key=lambda s: s['price'])
>>> expensive = heapq.nlargest(3, portfolio, key=lambda s: s['price'])
>>> cheap
[{'name': 'YHOO', 'shares': 45, 'price': 16.35}, {'name': 'FB', 'shares': 200, 'price': 21.09}, {'name': 'HPQ', 'shares': 35, 'price': 31.75}]
>>> expensive
[{'name': 'AAPL', 'shares': 50, 'price': 543.22}, {'name': 'ACME', 'shares': 75, 'price': 115.65}, {'name': 'IBM', 'shares': 100, 'price': 91.1}]
>>>