题解 | #最小的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> res;
for(int i=0;i<k;i++){
res.push_back(input[i]);
}
return res;
}
};
