Climbing Stairs

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?

» Solve this problem

方法：

这道题和fibonacci的算法非常接近。根据题意，对于爬到一个n阶楼梯所用的步数，等于爬到n-1阶加上n-2阶所用步数之和。

Code:

1.递归法

public class Solution {
    public int climbStairs(int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(n==1) return 1;
        if(n==2) return 2;
        return climbStairs(n-1) + climbStairs(n-2);
    }
}

2.递归DP法

public class Solution {
    public int climbStairs(int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int[] dp = new int[n];
        return recImp(dp, n-1);
    }
    private int recImp(int[] dp, int n){
        if(n == 0) dp[n] = 1;
        if(n == 1) dp[n] = 2;
        if(dp[n] != 0) return dp[n];
        dp[n] = recImp(dp, n-1) + recImp(dp, n-2);
        return dp[n];
    }
}

3.纯DP法

public class Solution {
    public int climbStairs(int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int[] dp = new int[n];
        for(int i=0; i<n; i++){
            if(i==0) dp[i] = 1;
            else if(i==1) dp[i] = 2;
            else dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n-1];
    }
}

总结：

和fibonacci的算法很相似，最终我们只需要知道：递归的过程，以及DP所建立的数组的作用，从而完全掌握这三种方法。