Day 38 动态规划 - 斐波那契数

509. 斐波那契数 function fib(n: number): number { const dp = [0, 1]; for (let i = 2; i <= n; i++) { dp[i] = dp[i - 1] + dp[i - 2]; }; return dp[n]; }; 70. 爬楼梯 function climbStairs(n: number): number { const dp = [1, 1]; ...