JavaScript 中的阶乘递归

javascriptweb developmentfront end technologyobject oriented programming更新于 2025/11/24 13:00:17

我们需要编写一个 JavaScript 函数，利用递归方法计算数字 n 的阶乘。

在这里，我们查找阶乘递归并创建自定义函数 recursiceFactorial() −

const num = 9;
const recursiceFactorial = (num, res = 1) => {
   if(num){
      return recursiceFactorial(num-1, res * num);
   };
   return res;
};

现在，我们将调用该函数并传递值以查找递归 −

console.log(recursiceFactorial(num));
console.log(recursiceFactorial(6));
console.log(recursiceFactorial(10));

示例

让我们来编写该函数的代码 −

const num = 9;
const recursiceFactorial = (num, res = 1) => {
   if(num){
      return recursiceFactorial(num-1, res * num);
   };
   return res;
};
console.log(recursiceFactorial(num));
console.log(recursiceFactorial(6));
console.log(recursiceFactorial(10));
console.log(recursiceFactorial(5));
console.log(recursiceFactorial(13));