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]

 

posted @ 2020-05-09 15:10  星海寻梦233  阅读(81)  评论(0)  编辑  收藏  举报