题目:
思路:最小k个数,也可以放进去priority_queue<int,vector<int>,greater<int>>
我是sort的,这题太简单了,没什么好讲的
代码是:
方法一:
class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k) {
vector<int> res;
priority_queue<int,vector<int>,greater<int>> q;
for(auto n:arr){
q.push(n);
}
while(k--){
res.push_back(q.top());
q.pop();
}
return res;
}
};
代码二:
class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k) {
int len = arr.size();
vector<int> res;
sort(arr.begin(),arr.end());
for(int i=0;i<k;i++){
res.push_back(arr[i]);
}
return res;
}
};