Java
class Solution {
public int climbStairs(int n) {
if(n == 1) return 1;
if(n == 2) return 2;
int[] nums = new int[n+1];
nums[1] = 1;
nums[2] = 2;
climb(nums,n);
return nums[n];
}
public static void cl