二叉堆的 Python 实现

  class BinHeap: def __init__(self): self.heapList = [0] self.currentSize = 0 def percUp(self,i): while i // 2 > 0: if self.heapList[i] <= self.hea

>>阅读原文<<