题目描述:输入n个整数,找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4,。
思路:利用快速排序的中间过程,判断基准元素所处的位置的下标是否为K-1。
代码:
public static ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
ArrayList<Integer> arr = new ArrayList<Integer>();
if(input.length==0) return arr;
if(input.length<k) return arr;
int low = 0;
int high = input.length-1;
int index = partition(input, 0, high);
while(index!=k-1){
if(index<k-1){
index = partition(input, index+1, high);
}else{
index = partition(input, low, index-1);
}
}
for(int i=0;i<k;i++){
arr.add(input[i]);
}
return arr;
}
public static int partition(int [] array,int low,int high){
int temp = array[low];
while(low<high){
while(low<high && array[high]>=temp){
high--;
}
array[low] = array[high];
while(low<high && array[low]<=temp){
low++;
}
array[high] = array[low];
}
array[low] = temp;
return low;
}