LeetCode 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.

先在网上搜到了一篇很不错的博客 点击打开链接，看了之后对求解动态规划算法的题目有一点懂了，但是真正做题时，还是要注意，要把递推公式的求法改写为从前向后的循环，才能保证时间复杂度不会太大 点击打开链接

public class Solution {
    public int climbStairs(int n) {
        if(n<=0){
            return 0;
        }else{
            if(n==1 || n==2){
                return n;
            }else{
                int [] dp = new int[n+1];
                dp[0]=0;
                dp[1]=1;
                dp[2]=2;
                for(int i=3;i<n+1;i++){
                    dp[i]=dp[i-1]+dp[i-2];
                }
                return dp[n];
            }
        }
    }
}