[leetcode]Climbing Stairs

最新推荐文章于 2024-09-16 17:05:22 发布

Brett-Xu

最新推荐文章于 2024-09-16 17:05:22 发布

阅读量86

点赞数

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

本文链接：https://blog.csdn.net/weixin_41814716/article/details/83214811

版权

LeetCode 专栏收录该内容

102 篇文章 0 订阅

订阅专栏

Question:

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.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

分析：

爬到第n层的方法是从第n-1层一步上来的或是从n-2层2步上来的，所以递推公式：num[n] = num[n-1] + num[n-2]

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