堆，python库heapq

简述

大顶堆：每个节点的值都大于其子节点
小顶堆：每个节点的值都小于其子节点。
heapq :提供构建小顶堆的方法

heapq库

• 创建堆
  heappush(heap, item) 新建创建
  heapify(array) 原地创建

import heapq
array = [10, 17, 50, 7, 30, 24, 27, 45, 15, 5, 36, 21]
#  第一种方法
heap = []
for i in array:
    heapq.heappush(heap, i)
print(heap)

#  第二种方法
heapq.heapify(array)
print(array)

[5, 7, 21, 15, 10, 24, 27, 45, 17, 30, 36, 50]
[5, 7, 21, 10, 17, 24, 27, 45, 15, 30, 36, 50]

• 弹出堆顶 heappop(heap)

item = heapq.heappop(heap)
print(item)
print(heap)

 5
[7, 10, 21, 15, 30, 24, 27, 45, 17, 50, 36]

• 获取最大值和最小值
  heapq.nlargest(num, heap) 最大值
  heapq.nsmallest(num, heap) 最小值
  从堆/列表中返回num个数字，从最大/最小的数字开始取，返回的是个列表。这个方法可以用于堆，也可以用于列表。

array = [10, 17, 50, 7, 30, 24, 27, 45, 15, 5, 36, 21]
heap = []
for i in array:
    heapq.heappush(heap, i)
print(heap)
print(heapq.nlargest(5, heap))

print(heapq.nlargest(5, array))

[5, 7, 21, 15, 10, 24, 27, 45, 17, 30, 36, 50]
[50, 45, 36, 30, 27]
[50, 45, 36, 30, 27]

• 使用 heapq.merge(list1, list2) 合并两个有序列表，合并后的列表仍然是有序的

array_a = [10, 7, 15, 8]
array_b = [17, 3, 8, 20, 13]
array_merge = list(heapq.merge(array_a, array_b))
print(array_merge)  # 注意， 带合并的列表必须是有序的

array_merge = list(heapq.merge(sorted(array_a), sorted(array_b)))
print(array_merge)  # 注意， 带合并的列表必须是有序的

[10, 7, 15, 8, 17, 3, 8, 20, 13]
[3, 7, 8, 8, 10, 13, 15, 17, 20]