用heapq对列表拍序

最新推荐文章于 2022-08-25 21:19:49 发布

秋月银鸽

最新推荐文章于 2022-08-25 21:19:49 发布

阅读量130

点赞数

文章标签： python

原文链接：https://github.com/jackfrued/Python-100-Days/blob/master/Day16-20/16-20.Python%E8%AF%AD%E8%A8%80%E8%BF%9B%E9%98%B6.md

版权

import heapq
list1 = [34, 25, 12, 99, 87, 63, 58, 78, 88, 92]
print(heapq.nsmallest(len(list1),list1)) #升序

print(heapq.nlargest(len(list1),list1)) #降序

还可以

从列表中找出最大的或最小的N个元素
堆结构(大根堆/小根堆)

import heapq

list1 = [34, 25, 12, 99, 87, 63, 58, 78, 88, 92]
list2 = [
    {'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}
]
print(heapq.nlargest(3, list1))
print(heapq.nsmallest(3, list1))
print(heapq.nlargest(2, list2, key=lambda x: x['price']))
print(heapq.nlargest(2, list2, key=lambda x: x['shares']))