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.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

到达目的地：要么最后一步为1步，要么最后一步为2步 所以当n>=3是f(n)=f(n-1)+f(n-2)

    public int climbStairs(int n) {
        if(n==1) {
            return 1;
        }else if(n==2) {
            return 2;
        }
        return climbStairs(n-1)+climbStairs(n-2);
        
    }
    超时了0 0 修改下：

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