题解 | #最小的K个数#
最小的K个数
http://www.nowcoder.com/questionTerminal/6a296eb82cf844ca8539b57c23e6e9bf
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
vector<int> output;
if(input.empty() || k<0 || input.size()<k)
return output;
sort(input.begin(),input.end());
int i=0;
while(i<k)
{
output.push_back(input[i]);
i++;
}
return output;
}
};</int></int></int>
