heapq基本用法

"""
从列表中找出最大的或最小的N个元素
堆结构(大根堆/小根堆)
"""
import heapq

if __name__ == '__main__':

    # heapq.heappush 参数1用于排序的空列表，参数二需要被排序的列表，键入对排列中，被排序
    # heapq.heappop(heap)弹出堆排序列表中一个元素
    nums = [2, 3, 5, 1, 54, 23, 132]
    heap = []
    for num in nums:
        heapq.heappush(heap, num)
    print(heap)#[1, 2, 5, 3, 54, 23, 132]
    print(heapq.heappop(heap))#1
    print(heap)#[2, 3, 5, 132, 54, 23]
    print(nums)#[2, 3, 5, 1, 54, 23, 132]

    #heapq.heapify 将列表转化为堆排序完成的列表，默认从小到大
    nums = [