题解 | #最小的K个数#
最小的K个数
https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
if(k == 0) return {};
sort(input.begin(),input.end()); //用优先队列可以满足时间复杂度要求
vector<int> res;
for(int i=0;i<k;i++) res.push_back(input[i]);
return res;
}
};
