CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-02 10:13:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

A few bug fixes.

Browse Source
This commit is contained in:
krahets
2023-11-03 22:48:43 +08:00
parent 6c16276494
commit 5f3ad1ed3d
26 changed files with 52 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/zig/chapter_dynamic_programming/coin_change.zig
View File

@@ -18,7 +18,7 @@ fn coinChangeDP(comptime coins: []i32, comptime amt: usize) i32 {
for (1..n + 1) |i| {
for (1..amt + 1) |a| {
if (coins[i - 1] > @as(i32, @intCast(a))) {
// 若超过背包容量，则不选硬币 i
// 若超过目标金额，则不选硬币 i
dp[i][a] = dp[i - 1][a];
} else {
// 不选和选硬币 i 这两种方案的较小值
@@ -45,7 +45,7 @@ fn coinChangeDPComp(comptime coins: []i32, comptime amt: usize) i32 {
for (1..n + 1) |i| {
for (1..amt + 1) |a| {
if (coins[i - 1] > @as(i32, @intCast(a))) {
// 若超过背包容量，则不选硬币 i
// 若超过目标金额，则不选硬币 i
dp[a] = dp[a];
} else {
// 不选和选硬币 i 这两种方案的较小值

4
codes/zig/chapter_dynamic_programming/coin_change_ii.zig
View File

@@ -17,7 +17,7 @@ fn coinChangeIIDP(comptime coins: []i32, comptime amt: usize) i32 {
for (1..n + 1) |i| {
for (1..amt + 1) |a| {
if (coins[i - 1] > @as(i32, @intCast(a))) {
// 若超过背包容量，则不选硬币 i
// 若超过目标金额，则不选硬币 i
dp[i][a] = dp[i - 1][a];
} else {
// 不选和选硬币 i 这两种方案的较小值
@@ -38,7 +38,7 @@ fn coinChangeIIDPComp(comptime coins: []i32, comptime amt: usize) i32 {
for (1..n + 1) |i| {
for (1..amt + 1) |a| {
if (coins[i - 1] > @as(i32, @intCast(a))) {
// 若超过背包容量，则不选硬币 i
// 若超过目标金额，则不选硬币 i
dp[a] = dp[a];
} else {
// 不选和选硬币 i 这两种方案的较小值