奈学p7-业务架构师1期
// 数组求和public class ArraySum {
public static int sum(int[] array) {
return sum(array, 0, array.length);
}
public static int sum(int[] array, int start, int end) {
if (start == end) {
return array[start];
}
if (start > end) {
return 0;
}
int mid = (start + end) / 2;
return sum(array, start, mid - 1) + array[mid] + sum(array, mid + 1, end);
}}