最小的K个数
输入n个整数,找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4,。
import java.util.ArrayList;
public class FindMinNum {
public static void main(String[] args) {
// TODO Auto-generated method stub
FindMinNumSolution findMinNumSolution = new FindMinNumSolution();
int[] arr = { 4, 5, 1, 6, 2, 7, 3, 8 };
ArrayList<Integer> result = findMinNumSolution.GetLeastNumbers_Solution(arr, 4);
System.out.println(result);
}
}
class FindMinNumSolution {
public ArrayList<Integer> GetLeastNumbers_Solution(int[] input, int k) {
ArrayList<Integer> list = new ArrayList<Integer>();
if (input.length < k || k == 0)
return list;
for (int i = 0; i < k; i++)
list.add(input[i]);
for (int i = k; i < input.length; i++) {
int j = this.getMax(list);
int temp = (Integer) list.get(j);
if (input[i] < temp)
list.set(j, input[i]);
}
return list;
}
public int getMax(ArrayList<Integer> list) {
int max = list.get(0);
int j = 0;
for (int i = 0; i < list.size(); i++) {
if (list.get(i) > max) {
max = list.get(i);
j = i;
}
}
return j;
}
}