Python的heapq模块

1. heapq.heappush(heap, item): 将item加入到堆heap中

>>> heap = [0,3,9,7,4]
>>> heapq.heappush(heap, 10)
>>> heap
[0, 3, 9, 7, 4, 10]

2. heapq.heappop(heap) : 将堆中的最小元素 (heap[0]) pop出heap.

>>> heapq.heappop(heap)#heap在pop时总是将最小值首先pop出
1
>>> heap
[2, 3, 9, 7, 10]

3 heapq.heappushpop(heap,item) : 将最小元素pop出来，然后将item元素加入到heap中
3. heapq.heapify(x) 将list转换成一个小根堆
4. heapq.heapreplace(heap,item)：pop出最小值，推入item，heap的尺寸不变
5. heapq.nlargest(n,iterable,key) 取出堆中最大的n个元素
6. heapq.nsmallest(n,iterable,key) 取出堆中最小的n个元素