题解 | #最小的K个数#

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param input int整型一维数组 
# @param k int整型 
# @return int整型一维数组
#
from typing import List
import heapq

class Solution:
    def GetLeastNumbers_Solution(self , input: List[int], k: int) -> List[int]:
        # write code here
        if k == 0:
            return []
        heap = []
        for x in input:
            if len(heap) >= k:
                if -heap[0] > x:
                    heapq.heapreplace(heap, -x)
            else:
                heapq.heappush(heap, -x)
        return list(-item for item in heap)