---

[!info] related notes 算法面试题型 MOC 动态规划

爬楼梯

题目

题解

var climbStairs = function(n) {
    const dp = new Array(n+1).fill(0);
    dp[0] = 1
    dp[1] = 1;
    for (let i = 2; i <= n; i++) {
        dp[i] = dp[i-1] + dp[i-2];
    }
    return dp[n]
};

参考