@@ -0,0 +1,611 @@
+/**%0A * Problem: https://leetcode.com/problems/climbing-stairs/%0A * %0A * Solution: Easy dynamic programming problem with memorization.%0A */%0A%0Apublic class Solution %7B%0A    private int%5B%5D choices;%0A    public int climbStairs(int n) %7B%0A        choices = new int%5Bn+1%5D;%0A        for(int i=0; i%3C=n; i++) choices%5Bi%5D = -1;%0A        return solve(n);%0A    %7D%0A    %0A    private int solve(int x) %7B%0A        if(choices%5Bx%5D != -1) return choices%5Bx%5D;%0A        if(x == 0) return choices%5Bx%5D = 1;%0A        choices%5Bx%5D = 0;%0A        if(x %3E= 1) choices%5Bx%5D += solve(x-1);%0A        if(x %3E= 2) choices%5Bx%5D += solve(x-2);%0A        return choices%5Bx%5D;%0A    %7D%0A%7D%0A

Create Climbing_Stairs.java