//递归解耦
var factorial=function (n) {
if(n<=1) return 1;
else return n*arguments.callee(n-1);
}
//f拥有了指针位置
var f=factorial;
//清空factorial
factorial=null;
let rs=f(3);
console.log(rs);
//递归解耦
var factorial=function (n) {
if(n<=1) return 1;
else return n*arguments.callee(n-1);
}
//f拥有了指针位置
var f=factorial;
//清空factorial
factorial=null;
let rs=f(3);
console.log(rs);