@@ -0,0 +1,253 @@
+package leetcode.climbing_stairs;%0A%0Apublic class Solution %7B%0A    public int climbStairs(int n) %7B%0A        int a = 1, b = 1;%0A        while(n %3E 0)%7B%0A        %09int tmp = a;%0A        %09a = a + b;%0A        %09b = tmp;%0A        %09n--;%0A        %7D%0A        return b;%0A    %7D%0A%7D%0A

Add java solution for 70. Climbing Stairs