阶乘 Factorial Algorithm
1.递归
function factorial(num) {
if(num<0){
return -1
}
if(num === 0 || num===1){
return 1;
}
return num*f(num-1);
}
factorial(5);
2.while 循环
function factorial(num){
var result = num;
if(num<0){
return -1;
}
else if(num===0||num===1){
return 1;
}
else{
while(num>1){
num--;
result *= num;
}
}
return result;
}
factorial(5);
3.for 循环
function factorial(num){
if(num<0){
return -1;
}else if(num===0||num===1){
return 1;
}else{
for(var i=num-1;i>=1;i--){
num *= i;
}
}
return num;
}
factorial(5);