原题:http://www.cnblogs.com/graphics/archive/2010/08/24/1761620.html#link18
给定一个含有n个元素的整型数组,求其最大值和次大值
public class MaxAndSecond {
public static void main(String[] args) {
// TODO 自动生成的方法存根
int[] arr = new int[2];
int[] a = {1,8,1,84,4,9,102,74,52,3,30,55,84};
int l = 0,r=a.length-1;
maxAndMinArr(a, l, r, arr);
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]);
}
}
private static void maxAndMinArr(int[] a, int l, int r, int[] ret){
if (l == r) {
ret[0] = a[l];
ret[1] = -0xffffffff;
return;
}
if (l + 1 ==r) {
ret[0] = a[l] > a[r] ? a[l] : a[r];
ret[1] = a[l] < a[r] ? a[l] : a[r];
return;
}
int m = (l + r) / 2;
int[] larr = new int[2];
maxAndMinArr(a, l, m, larr);
int[] rarr = new int[2];
maxAndMinArr(a, m+1, r, rarr);
if (larr[0] > rarr[0]) {
ret[0] = larr[0];
ret[1] = larr[1] > rarr[0] ? larr[1] : rarr[0];
}
else {
ret[0] = rarr[0];
ret[1] = rarr[1] > larr[0] ? rarr[1] : larr[0];
}
}
}
</pre><pre name="code" class="java">