mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-29 09:56:29 +08:00
b2f0d4603d
* Add Ruby and Kotlin icons Add the avatar of @curtishd * Update README * Synchronize zh-hant and zh versions. * Translate the pythontutor blocks to traditional Chinese * Fix en/mkdocs.yml * Update the landing page of the en version. * Fix the Dockerfile * Refine the en landingpage * Fix en landing page * Reset the README.md
54 lines
1.2 KiB
Go
54 lines
1.2 KiB
Go
// File: coin_change_ii.go
|
||
// Created Time: 2023-07-23
|
||
// Author: Reanon (793584285@qq.com)
|
||
|
||
package chapter_dynamic_programming
|
||
|
||
/* 零錢兌換 II：動態規劃 */
|
||
func coinChangeIIDP(coins []int, amt int) int {
|
||
n := len(coins)
|
||
// 初始化 dp 表
|
||
dp := make([][]int, n+1)
|
||
for i := 0; i <= n; i++ {
|
||
dp[i] = make([]int, amt+1)
|
||
}
|
||
// 初始化首列
|
||
for i := 0; i <= n; i++ {
|
||
dp[i][0] = 1
|
||
}
|
||
// 狀態轉移：其餘行和列
|
||
for i := 1; i <= n; i++ {
|
||
for a := 1; a <= amt; a++ {
|
||
if coins[i-1] > a {
|
||
// 若超過目標金額，則不選硬幣 i
|
||
dp[i][a] = dp[i-1][a]
|
||
} else {
|
||
// 不選和選硬幣 i 這兩種方案之和
|
||
dp[i][a] = dp[i-1][a] + dp[i][a-coins[i-1]]
|
||
}
|
||
}
|
||
}
|
||
return dp[n][amt]
|
||
}
|
||
|
||
/* 零錢兌換 II：空間最佳化後的動態規劃 */
|
||
func coinChangeIIDPComp(coins []int, amt int) int {
|
||
n := len(coins)
|
||
// 初始化 dp 表
|
||
dp := make([]int, amt+1)
|
||
dp[0] = 1
|
||
// 狀態轉移
|
||
for i := 1; i <= n; i++ {
|
||
// 正序走訪
|
||
for a := 1; a <= amt; a++ {
|
||
if coins[i-1] > a {
|
||
// 若超過目標金額，則不選硬幣 i
|
||
dp[a] = dp[a]
|
||
} else {
|
||
// 不選和選硬幣 i 這兩種方案之和
|
||
dp[a] = dp[a] + dp[a-coins[i-1]]
|
||
}
|
||
}
|
||
}
|
||
return dp[amt]
|
||
}
|