Leetcode 70 Climbing Stairs

Andrew9tech

于 2015-07-04 17:07:38 发布

阅读量376

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode刷题

本文链接：https://blog.youkuaiyun.com/Andrew9Tech/article/details/46756293

Leetcode刷题专栏收录该内容

38 篇文章

订阅专栏

class Solution:
    # @param {integer} n
    # @return {integer}
    def climbStairs(self, n):
        dp = [0, 1, 2]
        i = 3
        while i <= n:
            dp.append(dp[i-1] + dp[i-2])
            i += 1
        return dp[n]

class Solution:
    # @param {integer} n
    # @return {integer}
    def climbStairs(self, n):
        dp = [1]*(n + 1)
        for i in range(2, n + 1):
            dp[i] = dp[i-1] + dp[i-2]
        return dp[n]