输入整数数组 arr ,找出其中最小的 k 个数。例如,输入4、5、1、6、2、7、3、8这8个数字,则最小的4个数字是1、2、3、4。
示例 1:
输入:arr = [3,2,1], k = 2
输出:[1,2] 或者 [2,1]
示例 2:
输入:arr = [0,1,2,1], k = 1
输出:[0]
限制:
0 <= k <= arr.length <= 10000
0 <= arr[i] <= 10000
class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k) {
if (arr.empty() || k == 0)
return {};
priority_queue<int> window;
for (int i = 0; i < k; ++i)
window.push(arr[i]);
for (int i = k; i < arr.size(); ++i)
{
if (window.top() > arr[i])
{
window.pop();
window.push(arr[i]);
}
}
vector<int> res;
while (!window.empty())
{
res.push_back(window.top());
window.pop();
}
return res;
}
};