Time: 32 ms (53.84%), Space: 14.2 MB (72.68%) - LeetHub

Author: ericgitangu

Diff for: climbing-stairs/climbing-stairs.py

@@ -0,0 +1,26 @@
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        
+        steps = [1, 2]
+        cache = {}
+        
+        def dp(m, cache):
+            
+            if m in cache:
+                # print('Optimized')
+                return cache.get(m)
+            
+            if m == 0:
+                return 1
+            
+            elif m > n or m < 0:
+                return 0
+            
+            ways = 0
+            for step in steps:
+                ways += dp(m - step, cache)
+            
+            cache[m] = ways
+            return ways
+        return dp(n, cache)
+