mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 04:06:51 +08:00
添加0746.使用最小花费爬楼梯.md Go版本
This commit is contained in:
@ -228,7 +228,23 @@ Python:
|
|||||||
|
|
||||||
|
|
||||||
Go:
|
Go:
|
||||||
|
```Go
|
||||||
|
func minCostClimbingStairs(cost []int) int {
|
||||||
|
dp := make([]int, len(cost))
|
||||||
|
dp[0], dp[1] = cost[0], cost[1]
|
||||||
|
for i := 2; i < len(cost); i++ {
|
||||||
|
dp[i] = min(dp[i-1], dp[i-2]) + cost[i]
|
||||||
|
}
|
||||||
|
return min(dp[len(cost)-1], dp[len(cost)-2])
|
||||||
|
}
|
||||||
|
|
||||||
|
func min(a, b int) int {
|
||||||
|
if a < b {
|
||||||
|
return a
|
||||||
|
}
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user