Time: 68 ms (5.07%) | Memory: 18 MB (15.63%) - LeetSync

swolecoder · swolecoder · commit 08fb9d9bc420 · 2024-06-23T14:44:12.000-07:00
diff --git a/747-min-cost-climbing-stairs/min-cost-climbing-stairs.py b/747-min-cost-climbing-stairs/min-cost-climbing-stairs.py
@@ -0,0 +1,25 @@
+class Solution:
+    def minCostClimbingStairs(self, cost: List[int]) -> int:
+
+
+        def helper(index, memo = {}):
+            if index in memo:
+                return memo[index]
+
+            if index >= len(cost):
+                return 0
+            
+
+            one_step = helper(index +1,memo)
+            two_step= helper(index+2,memo)
+
+            min_cost = cost[index] + min(one_step, two_step)
+            memo[index] = min_cost
+
+            return memo[index]
+        
+        ans = min(helper(0), helper(1))
+
+
+        return ans
+        
