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.
79 lines
2.1 KiB
79 lines
2.1 KiB
/**
|
|
* File: coin_change.c
|
|
* Created Time: 2023-10-02
|
|
* Author: Zuoxun (845242523@qq.com)
|
|
*/
|
|
|
|
#include "../utils/common.h"
|
|
|
|
/* 求最小值 */
|
|
int min(int a, int b) {
|
|
return a < b ? a : b;
|
|
}
|
|
|
|
/* 零钱兑换：动态规划 */
|
|
int coinChangeDP(int coins[], int amt, int coinsSize) {
|
|
int n = coinsSize;
|
|
int MAX = amt + 1;
|
|
// 初始化 dp 表
|
|
int dp[n + 1][amt + 1];
|
|
memset(dp, 0, sizeof(dp));
|
|
// 状态转移：首行首列
|
|
for (int a = 1; a <= amt; a++) {
|
|
dp[0][a] = MAX;
|
|
}
|
|
// 状态转移：其余行列
|
|
for (int i = 1; i <= n; i++) {
|
|
for (int a = 1; a <= amt; a++) {
|
|
if (coins[i - 1] > a) {
|
|
// 若超过目标金额，则不选硬币 i
|
|
dp[i][a] = dp[i - 1][a];
|
|
} else {
|
|
// 不选和选硬币 i 这两种方案的较小值
|
|
dp[i][a] = min(dp[i - 1][a], dp[i][a - coins[i - 1]] + 1);
|
|
}
|
|
}
|
|
}
|
|
return dp[n][amt] != MAX ? dp[n][amt] : -1;
|
|
}
|
|
|
|
/* 零钱兑换：空间优化后的动态规划 */
|
|
int coinChangeDPComp(int coins[], int amt, int coinsSize) {
|
|
int n = coinsSize;
|
|
int MAX = amt + 1;
|
|
// 初始化 dp 表
|
|
int dp[amt + 1];
|
|
memset(dp, MAX, sizeof(dp));
|
|
dp[0] = 0;
|
|
// 状态转移
|
|
for (int i = 1; i <= n; i++) {
|
|
for (int a = 1; a <= amt; a++) {
|
|
if (coins[i - 1] > a) {
|
|
// 若超过目标金额，则不选硬币 i
|
|
dp[a] = dp[a];
|
|
} else {
|
|
// 不选和选硬币 i 这两种方案的较小值
|
|
dp[a] = min(dp[a], dp[a - coins[i - 1]] + 1);
|
|
}
|
|
}
|
|
}
|
|
return dp[amt] != MAX ? dp[amt] : -1;
|
|
}
|
|
|
|
/* Driver code */
|
|
int main() {
|
|
int coins[] = {1, 2, 5};
|
|
int coinsSize = sizeof(coins) / sizeof(coins[0]);
|
|
int amt = 4;
|
|
|
|
// 动态规划
|
|
int res = coinChangeDP(coins, amt, coinsSize);
|
|
printf("凑到目标金额所需的最少硬币数量为 %d\n", res);
|
|
|
|
// 空间优化后的动态规划
|
|
res = coinChangeDPComp(coins, amt, coinsSize);
|
|
printf("凑到目标金额所需的最少硬币数量为 %d\n", res);
|
|
|
|
return 0;
|
|
}
|