题解 | #最小的K个数#

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param input int整型一维数组 
# @param k int整型 
# @return int整型一维数组
#
class Solution:
    def GetLeastNumbers_Solution(self , input: List[int], k: int) -> List[int]:
        # write code here
        # write code here
        import heapq
        tmp = [-i for i in input]
        n = len(tmp)
        heap = []
        if k>n or n==0 or k==0:
            return []
        for i in tmp[:k]:
            heapq.heappush(heap, i)
        for j in tmp[k:n]:
            if j>heap[0]:
                heapq.heapreplace(heap, j)
        return [-i for i in heap]