70-climbing-stairs.md

/**
 * @param {number} n
 * @return {number}
 */

动态规划
var climbStairs = function(n) {
    let 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];
};