Leetcode: Climbing Stairs

最新推荐文章于 2024-09-27 18:45:08 发布

carlosten

最新推荐文章于 2024-09-27 18:45:08 发布

阅读量79

点赞数

分类专栏： Leetcode 文章标签： algorithm 面试

本文链接：https://blog.csdn.net/carlosten/article/details/38278853

版权

Leetcode 专栏收录该内容

154 篇文章 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?

c++:

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