這兩個特性使得把heap 當作一個標準的Python list 檢視時不會出現意外： heap[0] 是最小的物件， heap.sort() 能保持heap 的性質不變！ 建立一個heap 可以使用list 初始化 ... ... <看更多>

heapq.heapify doesn't return anything, it heapifies the list in place; it's far more efficient to do it that way: >>> import heapq >>> lista ... ... <看更多>

- Our heappop() method returns the smallest item, not the largest. These two make it possible to view the heap as a regular Python list. without ... ... <看更多>