寻找第K小的数,使用的方法有多种。今天,我主要是使用面试中面试官想要的方法。就是运用快排的思想在O(n)时间内得到结果。
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
int FindNumberK(vector<int>&iv,int k,int s,int e)
{
int roll = iv[s],be = 0,j = s;
for(int i = s+1;i <= e;++i)
{
if(iv[i] < roll)
{
++j;
swap(iv[i],iv[j]);
++be;
}
}
swap(iv[j],iv[s]);
if(be == k-1)
return roll;
else if(be < k-1){
return FindNumberK(iv,k-1 -be,j+1,e);
}else
return FindNumberK(iv,k,s,j-1);
}
int main()
{
int n;
while(cin>>n)
{
vector<int> iv,rv;
for(int i = 0;i != n;++i){
int val;
cin>>val;
iv.push_back(val);
rv.push_back(val);
}
int k;
cout<<"Please input a K num: ";
cin>>k;
if(k < 0||k >= iv.size()){
cout<<"Error\n";
exit(1);
}
int res = FindNumberK(iv,k,0,iv.size()-1);
cout<<"Test Result : "<<res<<endl;
sort(rv.begin(),rv.end(),less<int>());
cout<<"Real Result : "<<rv[k-1]<<endl;
}
return 0;
}