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

zig : update codes style && rust : add codes for chapter_backtracking. (#613)

Browse Source 
* zig : update codes style

* rust : add codes for chapter_backtracking

* zig : update codes style
This commit is contained in:
sjinzh
2023-07-16 15:36:28 +08:00
committed by GitHub
parent 51a4c5089e
commit ead33ca863
17 changed files with 312 additions and 71 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/zig/chapter_dynamic_programming/unbounded_knapsack.zig
View File

@@ -5,7 +5,7 @@
const std = @import("std");
// 完全背包：动态规划
fn unbounded_knapsack_dp(comptime wgt: []i32, val: []i32, comptime cap: usize) i32 {
fn unboundedKnapsackDP(comptime wgt: []i32, val: []i32, comptime cap: usize) i32 {
comptime var n = wgt.len;
// 初始化 dp 表
var dp = [_][cap + 1]i32{[_]i32{0} ** (cap + 1)} ** (n + 1);
@@ -25,7 +25,7 @@ fn unbounded_knapsack_dp(comptime wgt: []i32, val: []i32, comptime cap: usize) i
}
// 完全背包：状态压缩后的动态规划
fn unbounded_knapsack_dp_comp(comptime wgt: []i32, val: []i32, comptime cap: usize) i32 {
fn unboundedKnapsackDPComp(comptime wgt: []i32, val: []i32, comptime cap: usize) i32 {
comptime var n = wgt.len;
// 初始化 dp 表
var dp = [_]i32{0} ** (cap + 1);
@@ -51,11 +51,11 @@ pub fn main() !void {
comptime var cap = 4;
// 动态规划
var res = unbounded_knapsack_dp(&wgt, &val, cap);
var res = unboundedKnapsackDP(&wgt, &val, cap);
std.debug.print("不超过背包容量的最大物品价值为 {}\n", .{res});
// 状态压缩后的动态规划
res = unbounded_knapsack_dp_comp(&wgt, &val, cap);
res = unboundedKnapsackDPComp(&wgt, &val, cap);
std.debug.print("不超过背包容量的最大物品价值为 {}\n", .{res});
_ = try std.io.getStdIn().reader().readByte();