70. Climbing Stairs 类别：动态规划难度：easy

最新推荐文章于 2017-01-13 21:59:52 发布

luoyingmin

最新推荐文章于 2017-01-13 21:59:52 发布

阅读量233

点赞数

分类专栏：算法课作业

本文链接：https://blog.csdn.net/luoyingmin/article/details/54237395

版权

算法课作业专栏收录该内容

81 篇文章 1 订阅

订阅专栏

题目：

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?

思路：

类似斐波那契序列。

程序：

class Solution {
public:
    int climbStairs(int n) {
        vector<int> res(n + 1, 0);
        res[0] = 1;
        res[1] = 1;
        for(int i = 2;i <= n;i++)
            res[i] = res[i - 1] + res[i - 2];
        
        return res[n];
        
    }
};