Climbing Stairs

simple recursion problem

public class Solution {
    public int climbStairs(int n) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int[] table = new int[n+1];
        for(int i = 0; i < n+1; i++)
            table[i] = -1;
        return climb(table, n);
        
    }
    private int climb(int[] table, int n)
    {
        if(n == 0)
            return 0;
        else if(n == 1)
            return 1;
        else if(n == 2)
            return 2;
        else if(table[n] != -1)
            return table[n];
        else{
            table[n] = climb(table, n-1)+climb(table,n-2);
            return table[n];
        }
    }
}