【算法】- 递归计算阶乘

/**
 * Created by liusj 2019/4/20
 */
public class MainDemo {

    public static void main(String[] args) {
        System.out.println("5的阶乘：" + factorial(5));
    }


    /**
     * 用递归计算阶乘.
     *
     * @param n 参数
     * @return result 阶乘结果
     */
    public static int factorial(int n) {
        if (n <= 1) {
            return 1;
        }

        return n * factorial(n - 1);
    }
}