不用堆排序什么的,简单实现。
public class TopN {
@Test
public void topN() {
int[] initial = new int[] {20, 18, 10, 16, 14, 12, 9, 11, 8, 3, 5, 19, 8, 7, 6, 13, 17, 1, 15, 2, 4};
int m = 10;
int[] result = getTopN(initial, m);
for(int i = 0; i < result.length; i++) {
System.out.print(result[i] + " ");
}
}
private int[] getTopN(int[] initial, int m) {
int[] result = new int[m];
for(int i = 0; i < initial.length; i++) {
int minIndex = getMinIndex(result);
if(initial[i] > result[minIndex]) {
result[minIndex] = initial[i];
}
}
return result;
}
private int getMinIndex(int[] initial) {
int minValue = initial[0];
int minIndex = 0;
for (int i = 1; i < initial.length; i++) {
if (initial[i] < minValue) {
minIndex = i;
minValue = initial[i];
}
}
return minIndex;
}
}