mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 20:36:29 +08:00
78 lines
2.3 KiB
Zig
78 lines
2.3 KiB
Zig
|
// File: coin_change.zig
|
||
|
// Created Time: 2023-07-15
|
||
|
// Author: codingonion (coderonion@gmail.com)
|
||
|
|
||
|
const std = @import("std");
|
||
|
|
||
|
// 零錢兌換:動態規劃
|
||
|
fn coinChangeDP(comptime coins: []i32, comptime amt: usize) i32 {
|
||
|
comptime var n = coins.len;
|
||
|
comptime var max = amt + 1;
|
||
|
// 初始化 dp 表
|
||
|
var dp = [_][amt + 1]i32{[_]i32{0} ** (amt + 1)} ** (n + 1);
|
||
|
// 狀態轉移:首行首列
|
||
|
for (1..amt + 1) |a| {
|
||
|
dp[0][a] = max;
|
||
|
}
|
||
|
// 狀態轉移:其餘行和列
|
||
|
for (1..n + 1) |i| {
|
||
|
for (1..amt + 1) |a| {
|
||
|
if (coins[i - 1] > @as(i32, @intCast(a))) {
|
||
|
// 若超過目標金額,則不選硬幣 i
|
||
|
dp[i][a] = dp[i - 1][a];
|
||
|
} else {
|
||
|
// 不選和選硬幣 i 這兩種方案的較小值
|
||
|
dp[i][a] = @min(dp[i - 1][a], dp[i][a - @as(usize, @intCast(coins[i - 1]))] + 1);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
if (dp[n][amt] != max) {
|
||
|
return @intCast(dp[n][amt]);
|
||
|
} else {
|
||
|
return -1;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// 零錢兌換:空間最佳化後的動態規劃
|
||
|
fn coinChangeDPComp(comptime coins: []i32, comptime amt: usize) i32 {
|
||
|
comptime var n = coins.len;
|
||
|
comptime var max = amt + 1;
|
||
|
// 初始化 dp 表
|
||
|
var dp = [_]i32{0} ** (amt + 1);
|
||
|
@memset(&dp, max);
|
||
|
dp[0] = 0;
|
||
|
// 狀態轉移
|
||
|
for (1..n + 1) |i| {
|
||
|
for (1..amt + 1) |a| {
|
||
|
if (coins[i - 1] > @as(i32, @intCast(a))) {
|
||
|
// 若超過目標金額,則不選硬幣 i
|
||
|
dp[a] = dp[a];
|
||
|
} else {
|
||
|
// 不選和選硬幣 i 這兩種方案的較小值
|
||
|
dp[a] = @min(dp[a], dp[a - @as(usize, @intCast(coins[i - 1]))] + 1);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
if (dp[amt] != max) {
|
||
|
return @intCast(dp[amt]);
|
||
|
} else {
|
||
|
return -1;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// Driver Code
|
||
|
pub fn main() !void {
|
||
|
comptime var coins = [_]i32{ 1, 2, 5 };
|
||
|
comptime var amt: usize = 4;
|
||
|
|
||
|
// 動態規劃
|
||
|
var res = coinChangeDP(&coins, amt);
|
||
|
std.debug.print("湊到目標金額所需的最少硬幣數量為 {}\n", .{res});
|
||
|
|
||
|
// 空間最佳化後的動態規劃
|
||
|
res = coinChangeDPComp(&coins, amt);
|
||
|
std.debug.print("湊到目標金額所需的最少硬幣數量為 {}\n", .{res});
|
||
|
|
||
|
_ = try std.io.getStdIn().reader().readByte();
|
||
|
}
|