//递归计算阶乘
function getFactorial(n){
if(n==0||n==1){
return 1;
}else{
return n*getFactorial(n-1);
}
}
//递归结成相加
function getSum(n){
if(n==1){
return 1;
}else{
return getFactorial(n) + getSum(n-1);
}
}
//1!+2!+3!+4!+...
alert(getSum(4));
//递归计算阶乘
function getFactorial(n){
if(n==0||n==1){
return 1;
}else{
return n*getFactorial(n-1);
}
}
//递归结成相加
function getSum(n){
if(n==1){
return 1;
}else{
return getFactorial(n) + getSum(n-1);
}
}
//1!+2!+3!+4!+...
alert(getSum(4));
转载于:https://www.cnblogs.com/longze/archive/2013/02/16/2913295.html