import heapq nums = [-1, 34, 4, -114, 514, 1919,810] #返回前4大的數字 biggest = heapq.nlargest(4, nums) #返回前3小的數字 top = heapq.nsmallest(3, nums) print(biggest,top) #建立一個堆 將已有的元素塞到一個新數組裏 pp=[] for i in nums: heapq.heappush(pp,i) print(pp) #堆頂滾出去 heapq.heappop(pp) print(pp)
實際題目應用:第k大的數→https://www.cnblogs.com/AKsnoopy/p/15397247.html