导入堆模块
import heapq
创建堆(小顶堆)
#方法一,创建一个空堆,然后逐个加入
>>> heap = [] #创建一个空堆
>>> num_list = [5, 4, 3, 2, 1]
>>> for i in num_list:
>>> heapq.heappush(heap, i)
>>> heap
[1, 2, 3, 5, 4]
#方法二:直接将数组转为堆,in_place操作,O(len(heap))复杂度
>>> heapq.heapify(num_list)
>>> num_list
[1, 2, 3, 5, 4]
无序数组转化为小顶堆
heapq.heapify(list) # in_place操作
>>> nums = [5, 4, 3, 2, 1]
>>> heapq.heapify(nums)
[1, 2, 3, 5, 4]
插入
heapq.heappush(heap, item)
#插入item, 并保持堆结构的稳定性
弹出(最小元素)
heapq.heappop(heap)
#弹出最小元素, 并保持堆结构的稳定性
插入弹出
heapq.heappushpop(heap, item)
#先插入item,再弹出最小元素,比先 heapq.heappush(), 再heapq.heappop()的效率高
>>> heap = [1, 2, 3, 5, 4]
>>> heap.heappushpop(heap, 0)
0
弹出插入
heapq.heapreplace(heap, item)
#再弹出最小元素,先插入item,比先 heapq.heappop(), 再heapq.heappush()的效率高
>>> heap = [1, 2, 3, 5, 4]
>>> heap.heapreplace(heap, 0)
1 #先弹出1, 再插入零
获取前n个最大值 (利用小顶堆)
heapq.nlargest(n, iterable, key=None)
#效果有点像 sorted(iterable, key=key, reverse=True)[:n], 但前者时间复杂度更低
>>> nums = [5, 4, 3, 2, 1]
>>> result = heapq.nlargest(3, nums)
>>> result
[5, 4, 3]
获取前n个最小值 (利用大顶堆)
heapq.nsmallest(n, iterable, key=None)
#效果有点像 sorted(iterable, key=key)[:n], 但前者时间复杂度更低
>>> result = heapq.nsmallest(3, nums)
>>> result
[1, 2, 3]
融合合并多个排序后的序列成一个排序后的序列
heapq.merge(*iterables, key=None, reverse=False)
# returns a generator, 并且输入已经是从小到大排好序了。
# If *key* is not None, applies a key function to each element to determine
its sort order.
>>> list(heapq.merge([1,3,5,7], [0,2,4,8], [5,10,15,20], [], [25]))
[0, 1, 2, 3, 4, 5, 5, 7, 8, 10, 15, 20, 25]
>>> list(merge(['dog', 'horse'], ['cat', 'fish', 'kangaroo'], key=len)) #按照字符串长度排序
['dog', 'cat', 'fish', 'horse', 'kangaroo']