分治思想求数组最大值
public class DivideConquerDemo { public static void main(String[] args) { int[] arr = new int[]{1,6,8,9,2,4,6,18,3,5,7,9,2,5}; int n = arr.length; System.out.println("数组最大的数是:" + findMax(arr, 0, n-1)); } public static int findMax(int[] A, int l, int r){ int m = (l+r)/2; int x, u, v; if(l==r-1){return A[l];} else{ u = findMax(A,l,m); v = findMax(A,m,r); x = Math.max(u,v); } return x; } }
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)