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?

Solution : recursive , like Fibonacci number, this method has lots of overhead.

public class Solution {
    public int climbStairs(int n) {
        if(n == 1) return 1;
        if(n == 2) return 2;
        return climbStairs(n - 1) + climbStairs(n - 2);
    }
}

Solution 2 : DP, store the median result to an array

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

Solution 3 : save the space overhead

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