题解:
class Solution {
public:
vector<int> smallestK(vector<int>& arr, int k) {
vector<int> result;
if(arr.size() == 0){
return result;
}
if(k == arr.size()){
return arr;
}
//无序数组 最小k个数
sort(arr.begin(),arr.end());
result.assign(arr.begin(),arr.begin()+k);
return result;
}
};