Update Solution2.go

Author: yanglbme

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

@@ -1,7 +1,8 @@
 func minCostClimbingStairs(cost []int) int {
-	var f, g int
+	n := len(cost)
+	f := make([]int, n+1)
 	for i := 2; i <= n; i++ {
-		f, g = g, min(f+cost[i-2], g+cost[i-1])
+		f[i] = min(f[i-1]+cost[i-1], f[i-2]+cost[i-2])
 	}
-	return g
-}
+	return f[n]
+}