leetCode 70.Climbing Stairs （爬楼梯） 解题思路和方法

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?

思路：题目也比较简单，类似斐波那契。

代码如下：

public class Solution {
    public int climbStairs(int n) {
        //此题类似斐波那契数列
        if(n <= 0){
            return 0;
        }
        if(n <= 1){
            return 1;
        }
        if( n <= 2){
            return 2;
        }
        int i = 3;
        int f1 = 1;
        int f2 = 2;
        int f3 = 0;
        while(i++ <= n){
            f3 = f1+f2;
            f1 = f2;
            f2 = f3;
        }
        return f3;
    }
}

版权声明：本文为博主原创文章，未经博主允许不得转载。