Update Solution2.py

Author: yanglbme

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

@@ -1,6 +1,7 @@
 class Solution:
     def minCostClimbingStairs(self, cost: List[int]) -> int:
-        f = g = 0
-        for i in range(2, len(cost) + 1):
-            f, g = g, min(f + cost[i - 2], g + cost[i - 1])
-        return g
+        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]