题解 | #最小的K个数#
最小的K个数
http://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
一、排序直接输出
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
sort(input.begin(), input.end());
vector<int> ans;
for(int i = 0; i < k; i++){
ans.push_back(input[i]);
}
return ans;
}
};
查看5道真题和解析