【C++】【LeetCode】70. Climbing Stairs

最新推荐文章于 2022-05-31 00:07:44 发布

zjajgyy

最新推荐文章于 2022-05-31 00:07:44 发布

阅读量222

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/zjajgyy/article/details/75269149

版权

LeetCode 专栏收录该内容

51 篇文章 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?
Note: Given n will be a positive integer.

思路

其实就是求斐波那契数列的第n个。从低到高求，可以避免重复计算。

代码

class Solution {
public:
    int climbStairs(int n) {
        int sum = 0;
        int sumi = 0;
        int m = 1;
        while (m <= n) {
            if (m == 1) {
                sum++;
            } else if (m == 2) {
                sumi = sum;
                sum++;
            } else if (m > 2){
                int tmp = sum;
                sum = sum+sumi;
                sumi = tmp;
            }
            m++;
        }
        return sum;
    }
};