[LeetCode/python]Climbing Stairs/ dp

https://leetcode.com/problems/climbing-stairs/

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

Bottom-up 방식으로 설계

 

피보나치 문제와 비슷함