全排列与map红黑树,回头更新一下手写实现最小堆
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
if(k>input.size()) return vector<int>();
multiset<int> s;
for(int i=0;i<input.size();++i){
s.insert(input[i]);
}
set<int>::iterator it=s.begin();
while(k--){
it++;
}
return vector<int>(s.begin(),it);
}
};
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
if(k>input.size()) return vector<int>();
sort(input.begin(),input.end());
return vector<int>(input.begin(),input.begin()+k);
}
};