python算法小技巧

1、从集合中获得最大或者最小的 N 个元素列表

1.1不接受关键字参数的使用方式

import heapq

nums = [1, 2, 8, 6, 7, 54, 20]

print(heapq.nlargest(2, nums))
print(heapq.nsmallest(2, nums)

输出结果：

[54, 20]
[1, 2]

1.2 接受关键字参数的使用方式

import heapq

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(2, portfolio, key=lambda s: s['price'])
expensive = heapq.nlargest(2, portfolio, key=lambda s: s['price'])
print(cheap)
print(expensive)

输出结果：

[{‘name’: ‘YHOO’, ‘shares’: 45, ‘price’: 16.35}, {‘name’: ‘FB’, ‘shares’: 200, ‘price’: 21.09}]
[{‘name’: ‘AAPL’, ‘shares’: 50, ‘price’: 543.22}, {‘name’: ‘ACME’, ‘shares’: 75, ‘price’: 115.65}]

1.3如果单纯的只是想求出最小最大值可以采用列表内置函数

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}
]

print(min(portfolio, key=lambda s: s['price']))

输出结果：

{‘name’: ‘YHOO’, ‘shares’: 45, ‘price’: 16.35}