climbinb-stairs

Author: changhyumm

climbing-stairs/changhyumm.py

@@ -0,0 +1,12 @@
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        if n <= 1:
+            return 1
+        dp = [0] * n
+        print(dp)
+        dp[0] = 1
+        dp[1] = 2
+
+        for i in range(2, n):
+            dp[i] = dp[i-2] + dp[i-1]
+        return dp[-1]