github/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets 2024-04-14 17:41:33 +08:00
parent 584ced91eb
commit 653e2a2c75
2 changed files with 10 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/chapter_dynamic_programming/unbounded_knapsack_problem.md
View File

@ -1531,8 +1531,12 @@ $$
int n = coinsSize; int n = coinsSize;
int MAX = amt + 1; int MAX = amt + 1;
// 初始化 dp 表 // 初始化 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;
}
dp[0] = 0; dp[0] = 0;
// 状态转移 // 状态转移
for (int i = 1; i <= n; i++) { for (int i = 1; i <= n; i++) {
for (int a = 1; a <= amt; a++) { for (int a = 1; a <= amt; a++) {

6
zh-Hant/docs/chapter_dynamic_programming/unbounded_knapsack_problem.md
View File

@ -1531,8 +1531,12 @@ $$
int n = coinsSize; int n = coinsSize;
int MAX = amt + 1; int MAX = amt + 1;
// 初始化 dp 表 // 初始化 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;
}
dp[0] = 0; dp[0] = 0;
// 狀態轉移 // 狀態轉移
for (int i = 1; i <= n; i++) { for (int i = 1; i <= n; i++) {
for (int a = 1; a <= amt; a++) { for (int a = 1; a <= amt; a++) {