python找到最大或最小的N个元素

1.4 找到最大或最小的N个元素

• 第一：使用heapq模块中的nlargest() nsmallest()两个函数

>>> import heapq
>>> nums=[1,6,5,10,25,-3,37,2]
>>> print(heapq.nlargest(3,nums))
[37, 25, 10]
>>> print(heapq.nsmallest(3,nums))
[-3, 1, 2]
>>>

• 第二：或者对复杂的数据结构进行最大最小N个值的查找

>>> import heapq
>>> p =[{'name':"IBM","price":100.0},{"name":"Huawei","price":101},{"name":"Lenovo","price":102}]
>>> lowers = heapq.nsmallest(2,p,key=lambda s:s['price'])
>>> highest = heapq.nlargest(2,p,key=lambda s:s['price'])
>>> lowers
[{'name': 'IBM', 'price': 100.0}, {'name': 'Huawei', 'price': 101}]
>>> highest
[{'name': 'Lenovo', 'price': 102}, {'name': 'Huawei', 'price': 101}]
>>>

• 第三：若N=1使用min() max()会更方便

>>> a=[-4,-8,1,8,5,3]
>>> min(a)
-8
>>> max(a)
8
>>>

• 第四： 若N与数组长度相近则可以先对数组进行排序

>>> import heapq
>>> a=[-4,-8,1,8,5,3]
>>> heapq.heapify(a)
>>> a
[-8, -4, 1, 8, 5, 3]
>>>

然后使用heapq.heappop(a) 或使用for等方式找到想要的值

>>> heapq.heappop(a)
-8
>>> heapq.heappop(a)
-4
>>> heapq.heappop(a)
1
>>> a
[3, 8, 5]
>>>