【Leetcode-Easy-70】Climbing Stairs

最新推荐文章于 2025-08-07 20:34:46 发布

原创最新推荐文章于 2025-08-07 20:34:46 发布 · 701 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 同时被 2 个专栏收录

50 篇文章

订阅专栏

LeetCode

50 篇文章

订阅专栏

本文探讨了LeetCode中经典的问题——爬楼梯，通过递归和迭代的方法求解不同方式爬上楼梯的总数，并揭示其背后的数学规律——斐波那契数列。

【Leetcode-Easy-70】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?

Note: Given n will be a positive integer.

思路

斐波那契数列

程序

class Solution {

    // public int climbStairs(int n) {
    //     if (n <= 2) return n;
    //     return climbStairs(n-1) + climbStairs(n-2);
    // }


    // public int climbStairs(int n) {
    //     if (n <= 0) return 0;
    //     if (n == 1) return 1;
    //     if (n == 2) return 2;
    //     return climbStairs(n-1) + climbStairs(n-2);
    // }


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

        int result = 0;

        int first = 1;
        int second = 2;
        for (int i = 3; i <= n; i ++) {
            result = first + second;

            int temp = first;
            first = second;
            second = second + temp;

        }
        return result;
    }    
}

声明：题目来自Leetcode.