70.Climbing Stairs

class Solution:
    def climbStairs(self, n: int) -> int:
        dp = [1 for i in range(n+1)]
        for i in range(2, n+1):
            dp[i] = dp[i-1] + dp[i-2]
        return dp[n]
【推广】 免费学中医，健康全家人
原文地址：https://www.cnblogs.com/luo-c/p/12857225.html