题目描述
输入n个整数,找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4,。
package nowcoder.test1;
import java.util.ArrayList;
import java.util.Arrays;
public class GetLeastNumbers {
public static ArrayList<Integer> GetLeastNumbers_Solution(int[] input, int k) {
ArrayList<Integer> res = new ArrayList<Integer>();
if (k == 0 || k > input.length) {
return res;
}
int start = 0, end = input.length - 1;
int index = partition(input, start, end);
while (index != k - 1) {
if (index > k - 1) {
// 从index前面重新找
end = index - 1;
index = partition(input, start, end);
} else {
start = index + 1;
index = partition(input, start, end);
}
}
for (int i = 0; i < k; i++) {
res.add(input[i]);
}
return res;
}
private static int partition(int[] a, int start, int end) {
int tmp = a[start];
int i = start + 1, j = end;
while (i <= j) {
while (a[i] < tmp && i < end) {
i++;
}
while (a[j] > tmp && j > start + 1) {
j--;
}
if (i >= j) {
break;
}
exch(a, i, j);
}
exch(a, start, j);
return j;
}
private static void exch(int[] a, int i, int j) {
int swap = a[i];
a[i] = a[j];
a[j] = swap;
}
public static void main(String[] args) {
int[] a = { 9, 3, 15, 18, 22, 16, 5, 12, 7 };
ArrayList<Integer> list = GetLeastNumbers_Solution(a, 8);
for (Integer integer : list) {
System.out.print(integer + " ");
}
System.out.println();
Arrays.sort(a);
show(a);
}
static void show(int[] a) {
for (int i : a) {
System.out.print(i + " ");
}
System.out.println();
}
}