题目需求:递归求出数组之和
思路:和遍历数组一下,下标不断改变即可,边界条件是当下标越界
代码示例:
package recursion;
/*利用递归求数组里面的数字之和*/
public class Query_Sum {
public static void main(String[] args) {
int a[] = {1,2,3,4};
int i = 0;
int sum = Query_sum(a,i);
System.out.println(sum);
}
private static int Query_sum(int[] a,int i) {
if(i>a.length-1){
return 0;
}
return a[i]+Query_sum(a,i+1);
}
}