leetcode:70. Climbing Stairs

最新推荐文章于 2022-06-14 21:25:48 发布

nedwons

最新推荐文章于 2022-06-14 21:25:48 发布

阅读量185

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

26 篇文章

订阅专栏

博客围绕爬楼梯问题展开，指出这是一个动态规划问题。介绍了不同台阶数的基础情况，如 n<=0、n=1、n=2 时的走法数量。阐述了解题关键思路，还说明可构建数组求解，本质类似斐波那契数列，并给出 Java 实现及相关参考链接。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

sorry ,giving up..

想了下：

/*
思路整理：
1 和 2步
2=1+1
想考察什么？ 排列组合，分治
奇数偶数?
前缀树？
C21 
*/
class Solution {
public:
    int climbStairs(int n) {
        int count=0;
        
        
    }
};

想的不太清楚，

大佬的答案：

liaisonStaff

3862

Last Edit: October 22, 2018 11:15 AM

75.9K VIEWS

The problem seems to be a dynamic programming one. Hint: the tag also suggests that!
Here are the steps to get the solution incrementally.

Base cases:
if n <= 0, then the number of ways should be zero.
if n == 1, then there is only way to climb the stair.
if n == 2, then there are two ways to climb the stairs. One solution is one step by another; the other one is two steps at one time.
The key intuition to solve the problem is that given a number of stairs n, if we know the number ways to get to the points [n-1] and [n-2] respectively, denoted as n1 and n2 , then the total ways to get to the point [n] is n1 + n2. Because from the [n-1] point, we can take one single step to reach [n]. And from the [n-2] point, we could take two steps to get there.
The solutions calculated by the above approach are complete and non-redundant. The two solution sets (n1 and n2) cover all the possible cases on how the final step is taken. And there would be NO overlapping among the final solutions constructed from these two solution sets, because they differ in the final step.

Now given the above intuition, one can construct an array where each node stores the solution for each number n. Or if we look at it closer, it is clear that this is basically a fibonacci number, with the starting numbers as 1 and 2, instead of 1 and 1.

The implementation in Java as follows:

public int climbStairs(int n) {
    // base cases
    if(n <= 0) return 0;
    if(n == 1) return 1;
    if(n == 2) return 2;
    
    int one_step_before = 2;
    int two_steps_before = 1;
    int all_ways = 0;
    
    for(int i=2; i<n; i++){
    	all_ways = one_step_before + two_steps_before;
    	two_steps_before = one_step_before;
        one_step_before = all_ways;
    }
    return all_ways;
}

https://leetcode.com/problems/climbing-stairs/discuss/163347/Python-3000DP-or-tm Python - 3000字长文解释DP基础 | 公瑾™

LeetCode Climbing Stairs 递归求解和动态规划法

https://blog.csdn.net/kenden23/article/details/17377869 LeetCode Climbing Stairs 递归求解和动态规划法