Java🔗
最小堆 PriorityQueue🔗
PriorityQueue<Integer> pq = new PriorityQueue<>();
boolean success = pq.offer(3); //添加元素，有返回boolean
pq.peek(); //查看堆顶元素
Integer removed = pq.poll(); //移除堆顶元素
Python🔗
最小堆 heapq🔗
import heapq
heap = []
data = [3,1,4,1,5,9,2]
heapq.heapify(data) #转为堆结构
heapq.heappush(data, 5) #添加堆元素
min_element = heapq.heappop(heap) #弹出堆顶元素
min_element = heap[0] # 查看堆顶元素
heapq.heappush(heap,(value,key)) #key-value关系存到最小堆中， 以value值最小堆排序