xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 01:46:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix: Fixed the state transition error in minCostClimbingStairsDP function (#839)

Browse source 
Signed-off-by: foursevenlove <foursevenlove@gmail.com>
This commit is contained in:
47 2023-10-07 21:52:12 +08:00 committed by GitHub
parent 61e1d1faec
commit 70cff2d99f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 14 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
codes/go/chapter_dynamic_programming/min_cost_climbing_stairs_dp.go
View file

@ -4,14 +4,18 @@
package chapter_dynamic_programming
import "math"
/* 爬楼梯最小代价：动态规划 */
func minCostClimbingStairsDP(cost []int) int {
n := len(cost) - 1
if n == 1 || n == 2 {
return cost[n]
}
min := func(a, b int) int {
if a < b {
return a
}
return b
}
// 初始化 dp 表，用于存储子问题的解
dp := make([]int, n+1)
// 初始状态：预设最小子问题的解
@ -19,7 +23,7 @@ func minCostClimbingStairsDP(cost []int) int {
dp[2] = cost[2]
// 状态转移：从较小子问题逐步求解较大子问题
for i := 3; i <= n; i++ {
dp[i] = int(math.Min(float64(dp[i-1]), float64(dp[i-2]+cost[i])))
dp[i] = min(dp[i-1], dp[i-2]) + cost[i]
}
return dp[n]
}
@ -30,12 +34,18 @@ func minCostClimbingStairsDPComp(cost []int) int {
if n == 1 || n == 2 {
return cost[n]
}
min := func(a, b int) int {
if a < b {
return a
}
return b
}
// 初始状态：预设最小子问题的解
a, b := cost[1], cost[2]
// 状态转移：从较小子问题逐步求解较大子问题
for i := 3; i <= n; i++ {
tmp := b
b = int(math.Min(float64(a), float64(tmp+cost[i])))
b = min(a, tmp) + cost[i]
a = tmp
}
return b