Update Solution.go

Author: yanglbme

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

@@ -1,8 +1,18 @@
 func minCostClimbingStairs(cost []int) int {
 	n := len(cost)
-	f := make([]int, n+1)
-	for i := 2; i <= n; i++ {
-		f[i] = min(f[i-1]+cost[i-1], f[i-2]+cost[i-2])
+	f := make([]int, n)
+	for i := range f {
+		f[i] = -1
 	}
-	return f[n]
-}
+	var dfs func(int) int
+	dfs = func(i int) int {
+		if i >= n {
+			return 0
+		}
+		if f[i] < 0 {
+			f[i] = cost[i] + min(dfs(i+1), dfs(i+2))
+		}
+		return f[i]
+	}
+	return min(dfs(0), dfs(1))
+}