LeetCode70-爬楼梯

原题链接：https://leetcode-cn.com/problems/climbing-stairs/

解题思路：动态规划

状态转移方程：dp[i] = dp[i-1] + dp[i-2]

代码：

 1 class Solution:
 2     def climbStairs(self, n: int) -> int:
 3         if n <= 2:
 4             return n
 5         dp = [0] * (n+1)
 6         dp[0] = 0
 7         dp[1] = 1
 8         dp[2] = 2
 9         for i in range(3, n+1):
10             dp[i] = dp[i-1] + dp[i-2]
11         return dp[n]

 

posted @ 2022-01-11 22:59  CaptainDragonfly  阅读(47)  评论(0)    收藏  举报