Update Solution.py

Author: yanglbme

solution/0700-0799/0746.Min Cost Climbing Stairs/Solution.py

@@ -1,7 +1,9 @@
 class Solution:
     def minCostClimbingStairs(self, cost: List[int]) -> int:
-        n = len(cost)
-        f = [0] * (n + 1)
-        for i in range(2, n + 1):
-            f[i] = min(f[i - 2] + cost[i - 2], f[i - 1] + cost[i - 1])
-        return f[n]
+        @cache
+        def dfs(i: int) -> int:
+            if i >= len(cost):
+                return 0
+            return cost[i] + min(dfs(i + 1), dfs(i + 2))
+
+        return min(dfs(0), dfs(1))