用递归方法处理计算n的阶乘问题

分析

5! = 1 * 2 * 3 * 4 * 5 = 4! * 5

4! = 1 * 2 * 3 * 4 = 3! * 4

3! = 1 * 2 * 3 = 2! * 3

2! = 1 * 2 = 1! * 2

1! = 1

规律：1！=1；n! = (n-1)! * n

    public static void main(String[] args) {
        int num = getFactorial(5);
        System.out.println(num);//120
    }
    
    public static int getFactorial(int n){
        if(n == 1) {
            return 1;
        }else {
            return getFactorial(n-1)*n;
        }
        
    }