题解 | #最小的K个数#
最小的K个数
http://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
考察堆的使用
class Solution:
def GetLeastNumbers_Solution(self , input: List[int], k: int) -> List[int]:
# write code here
if not input or k == 0:
return []
import heapq
heapq.heapify(input)
res = []
for _ in range(min(k, len(input))):
res.append(heapq.heappop(input))
return res
查看3道真题和解析