Climbing Stairs

Author: iam-edwin

climbing-stairs/iam-edwin.java

@@ -0,0 +1,13 @@
+class Solution {
+    public int climbStairs(int n) {
+        int[] result = new int[n + 1];
+        result[0] = 1;
+        result[1] = 1;
+
+        for (int i = 2; i < n + 1; i++) {
+            result[i] = result[i - 1] + result[i - 2];
+        }
+
+        return result[n];
+    }
+}