From a78ce378cabce378919c8449490b58e44742f9e4 Mon Sep 17 00:00:00 2001 From: jiawenshi <909244296@qq.com> Date: Sun, 14 Apr 2024 11:23:46 +0800 Subject: [PATCH 1/3] add --- codes/c/chapter_dynamic_programming/coin_change.c | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/codes/c/chapter_dynamic_programming/coin_change.c b/codes/c/chapter_dynamic_programming/coin_change.c index d700eeb9f1..24cb599209 100644 --- a/codes/c/chapter_dynamic_programming/coin_change.c +++ b/codes/c/chapter_dynamic_programming/coin_change.c @@ -51,7 +51,11 @@ int coinChangeDPComp(int coins[], int amt, int coinsSize) { int MAX = amt + 1; // 初始化 dp 表 int *dp = calloc(amt + 1, sizeof(int)); + for (int j = 1; j <= amt; j++) { + dp[j] = MAX; + } dp[0] = 0; + // 状态转移 for (int i = 1; i <= n; i++) { for (int a = 1; a <= amt; a++) { From 0988b785377a70f5e6d609927348b9b5ab39609b Mon Sep 17 00:00:00 2001 From: Yudong Jin Date: Sun, 14 Apr 2024 17:26:41 +0800 Subject: [PATCH 2/3] Update coin_change.c --- codes/c/chapter_dynamic_programming/coin_change.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/codes/c/chapter_dynamic_programming/coin_change.c b/codes/c/chapter_dynamic_programming/coin_change.c index 24cb599209..8ba70951bf 100644 --- a/codes/c/chapter_dynamic_programming/coin_change.c +++ b/codes/c/chapter_dynamic_programming/coin_change.c @@ -50,7 +50,7 @@ int coinChangeDPComp(int coins[], int amt, int coinsSize) { int n = coinsSize; int MAX = amt + 1; // 初始化 dp 表 - int *dp = calloc(amt + 1, sizeof(int)); + int *dp = malloc(amt + 1, sizeof(int)); for (int j = 1; j <= amt; j++) { dp[j] = MAX; } From ff3f21d4d9b4673b635fd8667bab6e983442ab02 Mon Sep 17 00:00:00 2001 From: Yudong Jin Date: Sun, 14 Apr 2024 17:28:08 +0800 Subject: [PATCH 3/3] Update coin_change.c --- codes/c/chapter_dynamic_programming/coin_change.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/codes/c/chapter_dynamic_programming/coin_change.c b/codes/c/chapter_dynamic_programming/coin_change.c index 8ba70951bf..0bd9d1ae35 100644 --- a/codes/c/chapter_dynamic_programming/coin_change.c +++ b/codes/c/chapter_dynamic_programming/coin_change.c @@ -50,7 +50,7 @@ int coinChangeDPComp(int coins[], int amt, int coinsSize) { int n = coinsSize; int MAX = amt + 1; // 初始化 dp 表 - int *dp = malloc(amt + 1, sizeof(int)); + int *dp = malloc((amt + 1) * sizeof(int)); for (int j = 1; j <= amt; j++) { dp[j] = MAX; }