xieqian423#Docs-web#递归的最佳实现方式1

# js中递归函数的介绍 function factorial(num){ if(num<=1){ return 1; }else{ return num*factotoal(num-1); } } var func = factorial; factorial = null; func()