【LeetCode】Climbing Stairs

标签：leetcode

     题意 ：

     You are climbing a stair case. It takes n steps to reach to the top.
     Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

     思路：

     简单递推, 爬阶梯问题。第 i 层阶梯等于你从第 i -1 层迈一步上来或者从第 i-2 层迈两步上来。

    代码：

    C++：

class Solution {
public:
    int climbStairs(int n) {
        int *dp = new int[n+1];
        dp[0] = 1;
        dp[1] = 1;
        for(int i = 2;i <= n;++i)
            dp[i] = dp[i-1] + dp[i-2];
        return dp[n];
    }
};

     Python：

class Solution:
    # @param n, an integer
    # @return an integer
    def climbStairs(self, n):
        f = [0 for i in range(0,n+1)]
        f[0] = 1
        for i in range(1,n+1):
            f[i] = f[i-1] + f[i-2]
        return f[n]

【LeetCode】Climbing Stairs

标签：leetcode

原文地址：http://blog.csdn.net/jcjc918/article/details/43926603