python中的堆heapq模块

导入模块

import heapq

---

定义堆

python没有严格意义上的堆，只有一些关于堆操作，所以堆的定义可以是list

import heapq

但是这样有一个问题，那就是第一个元素不一定符合堆的性质
例如：

import heapq
heap = [3,1,4,7,5]
print(heap)
b = heapq.heappop(heap)
print(b)
print(heap)

结果为：
[3, 1, 4, 7, 5]
3
[1, 5, 4, 7]
把第一个元素弹出
所以堆最好通过heappush函数一个一个的添加元素

---

heappush(heap,i)向堆中加入元素

import heapq
a = [3,1,4,7,5]
heap = []
for i in a :
	heapq.heappush(heap,i)
print(heap)

运行结果为：
[1, 3, 4, 7, 5]
这样就把列表a中的元素以堆插入的方式添加到了列表heap中，heap也就成为了堆

---

heappop(heap) 函数删除堆顶元素

import heapq
a = [3,1,4,7,5]
heap = []
for i in a :
	heapq.heappush(heap,i)
for i in range(len(heap)):
	b = heapq.heappop(heap)
	print(b,end = ' ')
print()

运行结果为
1 3 4 5 7
按堆的方式删除堆顶元素。输出的数为递增的，说明该堆是最小值堆。

---

heapreplace(heap, i)删除堆顶元素同时将元素i 加入到堆中

import heapq
a = [3,1,4,7,5]
heap = []
for i in a :
	heapq.heappush(heap,i)
b = heapq.heapreplace(heap,10)
print(heap)

输出结果为:
[3, 5, 4, 7, 10]

---

nlargest(n,heap)以列表的形式返回最大的前n个值

import heapq
a = [3,1,4,7,5]
heap = []
for i in a :
	heapq.heappush(heap,i)
tmp = heapq.nlargest(3,heap)
print(tmp)

输出结果为：
[7, 5, 4]
如果把 n 的值变成堆的大小，就会返回一个降序列表

---

nsmallest(n, heap)以列表的形式返回最小的前n个值

import heapq
a = [3,1,4,7,5]
heap = []
for i in a :
	heapq.heappush(heap,i)
tmp = heapq.nsmallest(3,heap)
print(tmp)

输出结果为：
[1, 3, 4]
如果把 n 的值变成堆的大小，就会返回一个升序列表

---

关于类的堆

需要对 < 符合进行重载

def __lt__(self,t):
		return self.key<t.key

from heapq import *
class my():
	def __int__ (slef):
		slef.value = 0
		slef.key = 0
	def __lt__(self,t):
		return self.key<t.key

heap = []
a = [3,2,5,1,4]
for v,k in enumerate(a):
	tmp = my()
	tmp.value = v
	tmp.key = k
	heappush(heap,tmp)
for i in range(len(heap)):
	t = heappop(heap)
	print("key = ",t.key)
	print("value = ",t.value)
	print()

结果为：