add: climbing stairs solved

Author: JiHyeonSu

climbing-stairs/JiHyeonSu.py

@@ -0,0 +1,21 @@
+# 피보나치 수열
+# DP Bottom-up
+# 시간복잡도 및 공간복잡도 O(n)
+
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        if (n < 2):
+            return n
+
+        dp = [0] * (n + 1)
+
+        dp[1] = 1
+        dp[2] = 2
+
+        first, second = 1, 2
+
+        for i in range(3, n + 1):
+            dp[i] = dp[i - 1] + dp[i - 2]
+
+        return dp[n]
+