You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
hello-algo/zh-hant/codes/javascript/chapter_dynamic_programming/coin_change.js

67 lines
1.9 KiB

/**
* File: coin_change.js
* Created Time: 2023-08-23
* Author: Gaofer Chou (gaofer-chou@qq.com)
*/
/* 零錢兌換:動態規劃 */
function coinChangeDP(coins, amt) {
const n = coins.length;
const MAX = amt + 1;
// 初始化 dp 表
const dp = Array.from({ length: n + 1 }, () =>
Array.from({ length: amt + 1 }, () => 0)
);
// 狀態轉移:首行首列
for (let a = 1; a <= amt; a++) {
dp[0][a] = MAX;
}
// 狀態轉移:其餘行和列
for (let i = 1; i <= n; i++) {
for (let a = 1; a <= amt; a++) {
if (coins[i - 1] > a) {
// 若超過目標金額,則不選硬幣 i
dp[i][a] = dp[i - 1][a];
} else {
// 不選和選硬幣 i 這兩種方案的較小值
dp[i][a] = Math.min(dp[i - 1][a], dp[i][a - coins[i - 1]] + 1);
}
}
}
return dp[n][amt] !== MAX ? dp[n][amt] : -1;
}
/* 零錢兌換:狀態壓縮後的動態規劃 */
function coinChangeDPComp(coins, amt) {
const n = coins.length;
const MAX = amt + 1;
// 初始化 dp 表
const dp = Array.from({ length: amt + 1 }, () => MAX);
dp[0] = 0;
// 狀態轉移
for (let i = 1; i <= n; i++) {
for (let a = 1; a <= amt; a++) {
if (coins[i - 1] > a) {
// 若超過目標金額,則不選硬幣 i
dp[a] = dp[a];
} else {
// 不選和選硬幣 i 這兩種方案的較小值
dp[a] = Math.min(dp[a], dp[a - coins[i - 1]] + 1);
}
}
}
return dp[amt] !== MAX ? dp[amt] : -1;
}
/* Driver Code */
const coins = [1, 2, 5];
const amt = 4;
// 動態規劃
let res = coinChangeDP(coins, amt);
console.log(`湊到目標金額所需的最少硬幣數量為 ${res}`);
// 狀態壓縮後的動態規劃
res = coinChangeDPComp(coins, amt);
console.log(`湊到目標金額所需的最少硬幣數量為 ${res}`);