LeetCode 70: Climbing Stairs

最新推荐文章于 2021-05-04 14:27:15 发布

yongyuandeie

最新推荐文章于 2021-05-04 14:27:15 发布

阅读量235

点赞数

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

本文链接：https://blog.csdn.net/yongyuandeie/article/details/49507437

版权

leetcode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

Climbing Stairs

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?

解题思路

class Solution {
public:
    int climbStairs(int n) {
        if (n <= 2) return n;

        vector<int> dp(n, 0);
        dp[0] = 1; 
        dp[1] = 2;
        for (int i = 2; i < n; ++i) {
            dp[i] = dp[i-1] + dp[i-2];
        }

        return dp[n-1];
    }
};