35 lines
903 B
Python
35 lines
903 B
Python
#!/usr/bin/env python
|
|
# -*- encoding: utf-8 -*-
|
|
"""
|
|
Topic: 返回集合中最大或最小的N个元素
|
|
Desc :
|
|
"""
|
|
import heapq
|
|
|
|
|
|
def main():
|
|
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'])
|
|
print(cheap)
|
|
print(expensive)
|
|
|
|
nums = [1, 8, 2, 23, 7, -4, 18, 23, 42, 37, 2]
|
|
heapq.heapify(nums)
|
|
print(nums)
|
|
print(heapq.heappop(nums))
|
|
print(heapq.heappop(nums))
|
|
print(heapq.heappop(nums))
|
|
|
|
|
|
if __name__ == '__main__':
|
|
main()
|
|
|