骚气的Python之heapq的使用

官网文档https://docs.python.org/2/library/heapq.html

heapq.heapify(x)       把 list 堆排序（下文中参数里的 heap 都是由这一步得到的 list，如果未先 heapify 会出现错误）

import heapq
a = [2,4,1,5,6,3]
heapq.heapify(a)
print a

[1, 4, 2, 5, 6, 3]

heapq.heappush(heap, item)   添加 item 到 heap

import heapq
a = [2,4,1,5,6,3]
heapq.heapify(a)
heapq.heappush(a,7)
print a

[1, 4, 2, 5, 6, 3, 7]

heapq.heappop(heap)    删除最小的元素，并返回这个元素

import heapq
a = [2,4,1,5,6,3]
heapq.heapify(a)
b = heapq.heappop(a)
print a
print b

[2, 4, 3, 5, 6]
1

heapq.heappushpop(heap, item)   添加 item 到 heap 接着删除最小的元素并返回这个元素（删除的元素可能是刚添加的item）

import heapq
a = [2,4,1,5,6,3]
heapq.heapify(a)
b = heapq.heappushpop(a,7)
print a
print b

[2, 4, 3, 5, 6, 7]
1

heapq.heapreplace(heap, item)   把最小的元素用 item 替换，并返回这个元素

import heapq
a = [2,4,1,5,6,3]
heapq.heapify(a)
b = heapq.heapreplace(a,0)
print a
print b

[0, 4, 2, 5, 6, 3]
1

heapq.merge(*iterables)  合并多个 heap 并返回一个生成器，生成器生成的 list 也是 heap

import heapq
a = [2,4,1,5,6,3]
b = [7,0,9,8]
heapq.heapify(a)
heapq.heapify(b)
c = heapq.merge(a,b)
print a,b
d = [i for i in c]
print d
heapq.heapify(d)
print d

[1, 4, 2, 5, 6, 3] [0, 7, 9, 8]
[0, 1, 4, 2, 5, 6, 3, 7, 9, 8]
[0, 1, 3, 2, 5, 6, 4, 7, 9, 8]

heapq.nlargest(n, iterable[, key])    返回最大的前n个数的 list ( key 可以自定义，根据 key 进行排序 )

import heapq
a = [2,4,1,5,6,3]
print heapq.nlargest(3,a)

[6, 5, 4]

import heapq
a = [
    {"name":"d","age":3},
    {"name":"b","age":2},
    {"name":"c","age":4},
    {"name":"a","age":5},
    {"name":"f","age":1},
    {"name":"e","age":6},
    ]
print heapq.nlargest(3,a,key=lambda item:item["age"])
print heapq.nlargest(3,a,key=lambda item:item["name"])

[{'age': 6, 'name': 'e'}, {'age': 5, 'name': 'a'}, {'age': 4, 'name': 'c'}]
[{'age': 1, 'name': 'f'}, {'age': 6, 'name': 'e'}, {'age': 3, 'name': 'd'}]

heapq.nsmallest(n, iterable[, key])  返回最小的前n个数的 list ( key 可以自定义，根据 key 进行排序 )