1、直接利用递归:
package programmer;
import java.util.Scanner;
/*
* 利用递归
2、利用二叉查找寻找数组中的最大值:
package programmer;
import java.util.Scanner;
/*
* 利用二分查找法递归寻找数组中的最大值
*/
public class MaxBinarySearch {
public int maxBinarySearch(int[] A, int low, int high) {
if (low > high)
return -1;
else {
int mid = (low + high) / 2;
int tmp = maxBinarySearch(A, low, mid - 1) > maxBinarySearch(A,
mid + 1, high) ? maxBinarySearch(A, low, mid - 1)
: maxBinarySearch(A, mid + 1, high);
return tmp > A[mid] ? tmp : A[mid];
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] A = new int[N];
for (int i = 0; i < A.length; i++)
A[i] = sc.nextInt();
System.out.println(new MaxBinarySearch().maxBinarySearch(A, 0,
A.length - 1));
}
}
但是复杂度并没有减少,只是提供一种新的思考方法。