From 70cff2d99fe84479dbdc413bee89dd9009db2bd4 Mon Sep 17 00:00:00 2001
From: 47 <foursevenlove@gmail.com>
Date: Sat, 7 Oct 2023 21:52:12 +0800
Subject: [PATCH] fix: Fixed the state transition error in
 minCostClimbingStairsDP function (#839)

Signed-off-by: foursevenlove <foursevenlove@gmail.com>
---
 .../min_cost_climbing_stairs_dp.go             | 18 ++++++++++++++----
 1 file changed, 14 insertions(+), 4 deletions(-)

diff --git a/codes/go/chapter_dynamic_programming/min_cost_climbing_stairs_dp.go b/codes/go/chapter_dynamic_programming/min_cost_climbing_stairs_dp.go
index fdf9eba32..b99c58671 100644
--- a/codes/go/chapter_dynamic_programming/min_cost_climbing_stairs_dp.go
+++ b/codes/go/chapter_dynamic_programming/min_cost_climbing_stairs_dp.go
@@ -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