12 lines
366 B
Go
12 lines
366 B
Go
// Package q746 implements a solution for https://leetcode.com/problems/min-cost-climbing-stairs/
|
|
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
|