n!,公式为n*(n-1);
代码实现:
1、递归方法
function factorialize(num) {
if(num<0){
return -1;
}
else if(num===0||num===1){
return 1;
}
else{
return (num*factorialize(num-1));
}
}
factorialize(0);
2、for循环
function factorialize(num) {
if(num<0){
return -1;
}
else if(num===0||num===1){
return 1;
}
else{
//return (num*factorialize(num-1));
for(var i=num-1;i>=1;i--){
num*=i;
}
return num;
}
}
factorialize(10);