leetcode Climbing Stairs 2.17 难度系数2

yundomo

于 2014-01-27 12:45:33 发布

阅读量695

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/yiding_he/article/details/18812149

leetcode java 150 专栏收录该内容

86 篇文章

订阅专栏

本文探讨了一个经典的算法问题——爬楼梯。通过递推的方法，实现了对不同步数到达楼顶的不同方式数量的有效计算。

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

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?

public class Solution {
    public int climbStairs(int n) {  
        if (n == 0 || n == 1) return 1;  
        int prev = 1;  
        int current = 1;  
        int temp = 0;
        for (int i = 2; i <= n; i++) {  
            temp = prev + current;  
            prev = current;  
            current = temp;  
        }  
        return current;        
    }  
}