Java-递归.阶乘

所谓的递归：方法调用自身，称之为递归方法

递归方法需要有跳出的逻辑 否则StackOverflowError

调用自身时，彻底的参数要有规律

奇数和： 1+3+5+7+9+...+19

public static void main(String[] args) {
        //奇数和
        int result = computeAP(10);
        System.out.println(result);
}
private static int computeAP(int num) {
        num = num %2 == 0 ? num - 1 : num;
        if (num == 1) {
            return 1;
        }else {
            return num + computeAP(num -2);
}

阶乘：5=>(4,3,2,1) =>5*4*3*2*1

0的阶乘是1

一个大于1的阶乘数等于这个数乘以这个数减一的阶乘

int result2 = computeFactorial(5);
System.out.println(result2);
private static int computeFactorial(int num) {
    if (num <= 1) {
        return 1;
    } else {
        return num * computeFactorial(num - 1); //num * {(num-1)*[(num-2)*(num-3)]}
    }
}