完整测试源代码(VS2010):
// 33.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
vector<int> output;
int length=input.size();
if(length<=0 || k<=0 || k>length)
return output;
int start=0;
int end=length-1;
int index=partition(input, start, end);
while(index!=k-1){
if(index>k-1){
end=index-1;
index=partition(input, start, end);
}
else{
start=index+1;
index=partition(input, start,end);
}
}
for(int i=0; i<k; ++i){
output.push_back(input[i]);
}
return output;
}
int partition(vector<int> &input, int start, int end){
int pivot=input[start];
while(start<end){
while(start<end && pivot<=input[end])
end--;
swap(input[start],input[end]);
while(start<end && pivot>=input[start])
start++;
swap(input[start],input[end]);
}
return start;
}
void swap(int &a, int &b){
int temp;
temp=a;
a=b;
b=temp;
}
};
int _tmain(int argc, _TCHAR* argv[])
{
const int SIZE=5;
int a[SIZE]={5,2,1,4,3};
vector<int> input;
for(int i=0; i<SIZE; ++i)
input.push_back(a[i]);
vector<int> output;
Solution solution;
output=solution.GetLeastNumbers_Solution(input,3);
for(int i=0; i<output.size(); ++i)
cout<<output[i]<<endl;
return 0;
// 33.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
vector<int> output;
int length=input.size();
if(length<=0 || k<=0 || k>length)
return output;
int start=0;
int end=length-1;
int index=partition(input, start, end);
while(index!=k-1){
if(index>k-1){
end=index-1;
index=partition(input, start, end);
}
else{
start=index+1;
index=partition(input, start,end);
}
}
for(int i=0; i<k; ++i){
output.push_back(input[i]);
}
return output;
}
int partition(vector<int> &input, int start, int end){
int pivot=input[start];
while(start<end){
while(start<end && pivot<=input[end])
end--;
swap(input[start],input[end]);
while(start<end && pivot>=input[start])
start++;
swap(input[start],input[end]);
}
return start;
}
void swap(int &a, int &b){
int temp;
temp=a;
a=b;
b=temp;
}
};
int _tmain(int argc, _TCHAR* argv[])
{
const int SIZE=5;
int a[SIZE]={5,2,1,4,3};
vector<int> input;
for(int i=0; i<SIZE; ++i)
input.push_back(a[i]);
vector<int> output;
Solution solution;
output=solution.GetLeastNumbers_Solution(input,3);
for(int i=0; i<output.size(); ++i)
cout<<output[i]<<endl;
return 0;
}