lc-go/solutions/7/q746/solution.go
2026-01-09 18:00:28 +09:00

11 lines
268 B
Go

package q746
func minCostClimbingStairs(cost []int) int {
minCost := make([]int, len(cost)+1)
for i := 2; i < len(minCost); i++ {
minCost[i] = min(minCost[i-2]+cost[i-2], minCost[i-1]+cost[i-1])
}
return minCost[len(minCost)-1]
}
var _ = minCostClimbingStairs