Leetcode:Climbing Stairs

最新推荐文章于 2020-06-13 21:54:39 发布

Lin_drink_caffe

最新推荐文章于 2020-06-13 21:54:39 发布

阅读量344

点赞数

分类专栏： leetcode-c 文章标签： leetcode

本文链接：https://blog.csdn.net/Lin_drink_caffe/article/details/72631004

版权

leetcode-c 专栏收录该内容

21 篇文章

订阅专栏

#include <iostream>
#include <vector>
using namespace std;

class Solution1
{
public:
    int climbStairs(int n){
        if(n<=2)
        {
            return n;
        }
        else
        {
            int* step = new int[n];
            step[0]=1;
            step[1]=2;

            for(int i=2;i<n;i++){
                step[i]=step[i-1]+step[i-2];
            }

            int ret=step[n-1];

            delete []step;
            return ret;
        }
    }

};

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

};

int main(){
    Solution1 s1;
    cout<<s1.climbStairs(8)<<endl;
    Solution2 s2;
    cout<<s2.climbStairs(8)<<endl;
    return 0;
}