(个人水平有限,请见谅!)
题目描述:
输入n个整数,找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4,。
代码示例:
// 时间复杂度nlogk,如果直接排序输出前k个时间复杂度为nlogn
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
vector <int> res;
int len = input.size();
if (len==0 || k<=0 || len<k)
return res;
set <int, greater<int>> mink;
for (int i = 0; i < k; i++)
mink.insert(input[i]);
for (vector<int>::iterator it = input.begin()+k; it != input.end(); it++)
{
if (*it < *(mink.begin()))
{
mink.erase(mink.begin());
mink.insert(*it);
}
}
for (set<int>::iterator it = mink.begin(); it != mink.end(); it++)
{
res.push_back(*it);
}
return res;
}
};