📚 2.爬楼梯

💻 代码实现

/**
 * @url https://leetcode.cn/problems/climbing-stairs/description/
 */

// ps: 注意题意
function climbStairs(n: number): number {
    const dp = new Array(n + 1).fill(false)
    dp[0] = 0
    dp[1] = 1
    dp[2] = 2
    for (let i = 3; i <= n; i++) {
        dp[i] = dp[i - 1] + dp[i - 2]
    }
    return dp[n]
}