@@ -0,0 +1,495 @@
+/**%0A * You are climbing a stair case. It takes n steps to reach to the top.%0A * Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?%0A **/%0A%0Apublic class Solution %7B%0A    public int climbStairs(int n) %7B%0A        int%5B%5D step = new int%5Bn+2%5D;  // step should be large enough to contain step%5B1%5D and step%5B2%5D%0A        step%5B1%5D = 1;%0A        step%5B2%5D = 2;%0A        for(int i = 3; i %3C= n; i++)%0A            step%5Bi%5D = step%5Bi-1%5D + step%5Bi-2%5D;%0A        return step%5Bn%5D;%0A    %7D%0A%7D%0A

Create 070.java