climbing-stairs 문제 dp 풀이

- time complexity : O(n)
- space complexity : O(1)

Author: highballplz

climbing-stairs/highball.js

@@ -0,0 +1,11 @@
+const climbStairs = function (n) {
+  const dp = [1, 1];
+
+  for (let i = 0; i < n - 1; i++) {
+    const temp = dp[1];
+    dp[1] = temp + dp[0];
+    dp[0] = temp;
+  }
+
+  return dp[1];
+};