题解 | #最小花费爬楼梯#
最小花费爬楼梯
https://www.nowcoder.com/practice/6fe0302a058a4e4a834ee44af88435c7
func minCostClimbingStairs( cost []int ) int {
// write code here
dp := make([]int, len(cost)+1)
dp[0] = 0
dp[1] = 0
for i:=2; i<=len(cost); i++{
dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2])
}
return dp[len(cost)]
}
func min(x, y int) int{
if x < y {
return x
}
return y
}
腾讯泡池子960人在聊
查看19道真题和解析