>[danger]算法题，爬楼梯，斐波那契秒了 ~~~ const fib = (n) => { const nums = [0, 1] if (n <= 1) return n for (let i = 2; i <= n; i++) { nums[i] = nums[i - 1] + nums[i - 2] } return nums[n] } ~~~