70. Climbing Stairs

最新推荐文章于 2022-03-21 15:59:21 发布

t_jianyan

最新推荐文章于 2022-03-21 15:59:21 发布

阅读量153

点赞数

分类专栏： leetcode代码笔记

本文链接：https://blog.csdn.net/t_jianyan/article/details/53171677

版权

leetcode代码笔记专栏收录该内容

82 篇文章 0 订阅

订阅专栏

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?

MY 超时。。 O(2^N) so big

class Solution {
public:
    int climbStairs(int n) {
        if(n == 1)
        return 1;
        if(n == 2)
        return 2;
        else
        return climbStairs(n-1) + climbStairs(n-2) > INT_MAX ? INT_MAX : climbStairs(n-1) + climbStairs(n-2);
        
    }
};

DP!! more faster

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