基本信息

---

下载

   友情提示：（无需注册或充值，赞助后即可获取资源下载链接）

---

     嘿，亲！知识可是无价之宝呢，但咱这精心整理的资料也耗费了不少心血呀。小小地破费一下，绝对物超所值哦！如有下载和支付问题，请联系我们QQ(微信同号)：813200300

本次赞助数额为： 2 元　

支付宝支付

微信支付

   源码介绍

---

使用python内置heapq库实现列表排序（小顶堆）

mylist = list(random.sample(range(100), 10))
k = 3 largest = heapq.nlargest(k, mylist)
smallest = heapq.nsmallest(k, mylist) print('original list is', mylist) print('largest-'  str(k), '  is ', largest) print('smallest-'  str(k), ' is ', smallest) # heapify print('original list is', mylist)
heapq.heapify(mylist) print('heapify  list is', mylist) # heappush & heappop heapq.heappush(mylist, 105) print('pushed heap is', mylist)
heapq.heappop(mylist) print('popped heap is', mylist) # heappushpop & heapreplace heapq.heappushpop(mylist, 130) # heappush -> heappop print('heappushpop', mylist)
heapq.heapreplace(mylist, 2) # heappop -> heappush print('heapreplace', mylist)