Python heapq 快速找到最大的或最小的几个值

Python heapq 快速找到最大的或最小的几个值

Find the n largest elements in a dataset.
Equivalent to: sorted(iterable, key=key, reverse=True)[:n]

import heapq

lst=list(range(10))
print(heapq.nlargest(3,lst))#找到最大的3个值
#[9, 8, 7]
print(heapq.nsmallest(3,lst))#找到最小的3个值
#[0, 1, 2]

#需求:从字典中找到value最大(最小)的两个值返回他们的key
a=dict(zip('abcd',range(4)))#通过zip快速创建字典
print(a)
#{'a': 0, 'b': 1, 'c': 2, 'd': 3}
print(heapq.nlargest(2, a, key=lambda x: a[x]))
#['d', 'c']
print(heapq.nsmallest(2, a, key=lambda x: a[x]))
#['a', 'b']