LeetCode70-爬楼梯

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

解题思路：动态规划

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

代码：

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