题目描述
输入n个整数,找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4,。
代码如下
void GetLeasetNumbersOfK2(vector<int>& input, vector<int>& output, int lo, int hi, int k);
void quickSortHelper(vector<int>& input, int lo, int hi);
vector<int> GetLeastNumbers_Solution(vector<int> input, int k)
{
vector<int> numbers;
if(k == 0 || k > input.size() || input.empty()) return numbers;
//方法一,对所有的数字排列,效率低
// GetLeastNumbersOfK(input, numbers,k);
//方法二,只找出前k个数,然后进行排列,效率高;
GetLeasetNumbersOfK2(input,numbers,0,input.size()-1,k);
}
void GetLeastNumbersOfK(vector<int>& input, vector<int>& output,int k)
{
sort(input.begin(),input.end());
for(int i = 0; i < k && i < input.size(); i++)
{
output.push_back(input[i]);
}
}
void GetLeasetNumbersOfK2(vector<int>& input, vector<int>& output, int lo, int hi, int k)
{
int i = lo;
int j = hi;
if(lo > hi) return;
int mid = input[lo]; //找出基准数字
while(i != j)
{
while(i < j && mid <= input[j])
j--;
while(i < j && input[i] <= mid)
i++;
if(i < j)
{
input[i] = input[i] + input[j];
input[j] = input[i] - input[j];
input[i] = input[i] - input[j];
}
}
input[lo] = input[i]; //基准数字与i所在位置数字交换
input[i] = mid;
if(i == k - 1) //若i更好等于k-1,表示找到了前k个数字
{
for(int m = 0; m < k; m++)
output.push_back(input[m]);
return;
}
else if(i > k - 1)
GetLeasetNumbersOfK2(input,output,lo,i,k);
else
GetLeasetNumbersOfK2(input,output,i+1,lo,k);
}
void quickSortHelper(vector<int>& input, int lo, int hi)
{
int i = lo;
int j = hi;
if(lo > hi)
return;
int mid = input[i];
while(i != j)
{
while(i < j && mid < input[j]) //必须先写这一个,即从右端开始
j--;
while(i < j && input[i] < mid)
i++;
if(i < j)
{
input[i] = input[i] + input[j];
input[j] = input[i] - input[j];
input[i] = input[i] - input[j];
}
}
input[lo] = input[i];
input[i] = mid;
quickSortHelper(input,lo,i);
quickSortHelper(input,i+1,hi);
}
int fun(int a, int b);
int GetLeastNumofK()
{
vector<int> input,output;
int k = 4;
for(int i = 7; i ; i--)
input.push_back(i);
output = GetLeastNumbers_Solution(input,k);
return 0;
}