如何使用py​thon3中的heapq模块？

pip install heapq

nlargest()

nsmallest()

from heapq import *

def heap_sort(iterable):

 h = []

 for value in iterable:

 heappush(h, value)

 return [heappop(h) for _ in range(len(h))]

if __name__ == '__main__':

print(heap_sort([1, 3, 5, 9, 2, 123, 4, 88]))

Output: [1, 2, 3, 4, 5, 9, 88, 123]