解题思路:
1、最简单方法,先排序,再取前k个,时间复杂度O(NlogN)
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
vector<int> result;
int len = input.size();
if(len !=0&&!(len<k)) {
sort(input.begin(),input.end());
for(int i = 0;i<k;++i){
result.push_back(input[i]);
}
return result;
}else return result;
}
};