Leetcode Climbing Stairs

	
    public int climbStairs(int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
    	if(n == 0) return 0;
    	if(n == 1) return 1;
    	
    	int[] arr = new int[n + 1];
    	arr[0] = 0;
    	arr[1] = 1;
    	arr[2] = 2;
    	for(int j = 3; j <= n; j++) {
    		arr[j] = arr[j - 1] + arr[j - 2];
    	}
    		
        return arr[n];
    }