leetcode-70. Climbing Stairs

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?

依然是基本的动态规划。没有什么特别需要注意的

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