python - 在 python 中查看堆

Question

查看由 heapq 库创建的 python 堆的官方方法是什么？现在我有

def heappeak(heap):
  smallest = heappop(heap)
  heappush(heap, smallest)
  return smallest

可以说，这不是很好。我可以总是假设 heap[0] 是堆的顶部并使用它吗？还是会假设过多的底层实现？

Answer 1

是的，你可以做这个假设，因为它在 documentation 中有说明。 :

Heaps are arrays for which heap[k] <= heap[2*k+1] and heap[k] <=
heap[2*k+2] for all k, counting elements from zero. For the sake of comparison, non-existing elements are considered to be infinite. The interesting property of a heap is that heap[0] is always its smallest element.

(这可能是没有 peek 函数的原因:不需要它。)