1、递归求阶乘

//递归求阶乘

int recursiveFactorial(int n) {

    if(n ==0||n ==1) {

        return 1;

    }else{

        return n*recursiveFactorial(n-1);

    }

}