heapq( Heap queue algorithm)库
heapq( Heap queue algorithm)库从集合中取前n个最大,或最小的值nlargest(n,iterable)前n个最大的,nsmallest(n,iterable)前n个最小的import heapqnums=[1,23,32,45,67,21,78,12]print("3 largest",heapq.nlargest(3,nums))
print("3 smallest",
原创
2017-09-06 16:20:39 ·
520 阅读 ·
0 评论