Merge pull request #12 from iamAntimPal/Leetcode-75

Leetcode 75

Author: iamAntimPal

Solution/746. Min Cost Climbing Stairs/746. Min Cost Climbing Stairs.py

@@ -0,0 +1,9 @@
+class Solution:
+    def minCostClimbingStairs(self, cost: List[int]) -> int:
+        @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))