Update problems/0746.使用最小花费爬楼梯.md

This commit is contained in:
fwqaaq
2023-04-17 10:37:39 +08:00
committed by GitHub
parent 057d6b8f89
commit 341b0aa672

View File

@ -318,7 +318,7 @@ func min(a, b int) int {
var minCostClimbingStairs = function(cost) {
const dp = [0, 0]
for (let i = 2; i <= cost.length; ++i) {
dp[i] = Math.min(dp[i -1] + cost[i - 1], dp[i - 2] + cost[i - 2])
dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2])
}
return dp[cost.length]
};