【LeetCode】70. 爬楼梯 python实现

解题思路

动态规划

python 代码

class Solution:
    def climbStairs(self, n: int) -> int:
        dp = []
        dp.append(0)
        dp.append(1)
        dp.append(2)
        for i in range(3,n+1):
            dp.append(dp[i-1]+dp[i-2])
        return dp[n]

s = Solution()
result = s.climbStairs(3)
print(result)