递归闭包+优化

 function outer() {
            // 变量
            let arr = [0, 1, 1]
            function febo(n) {
                if (arr[n]) {
                    return arr[n]
                }
                let result = febo(n - 1) + febo(n - 2)
                // 将算好的储存到数组
                arr.push(result)
                return result
            }
            function aegArr(){
                return [...arr]
            }
            return {febo,aegArr}
        }
        let febo = outer()
       console.log(febo.febo(10));
       console.log(febo.aegArr());