package AlgorithmTest; /** * Created by dell on 2015/10/1. */ public class GetArraySumWithRecursionTest { public static void main(String[] args) { int[] array = new int[]{1, 2, 3, 4}; System.out.println(getArraySum(array)); } public static int getArraySum(int[] array){ return getArraySumUnit(array, 0); } private static int getArraySumUnit(int[] array, int begin){ if (begin == array.length - 1){ return array[begin]; }else{ return array[begin] + getArraySumUnit(array, begin + 1); } } }
递归求解数组的和 Java实现
最新推荐文章于 2021-06-26 10:22:44 发布