climbing stairs solution

Author: wad-jangjaejeong

climbing-stairs/jaejeong1.java

@@ -0,0 +1,22 @@
+class SolutionClimbStairs {
+
+  public int climbStairs(int n) {
+    if (n == 1) {
+      return 1;
+    }
+
+    if (n == 2) {
+      return 2;
+    }
+
+    int[] stairs = new int[n+1];
+    stairs[1] = 1;
+    stairs[2] = 2;
+
+    for (int i=3; i<=n; i++) {
+      stairs[i] = stairs[i-1] + stairs[i-2];
+    }
+
+    return stairs[n];
+  }
+}