CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-27 20:11:01 +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/climbing_stairs_dp.zig
View File

@@ -5,7 +5,7 @@
const std = @import("std");
// 爬楼梯：动态规划
fn climbing_stairs_dp(comptime n: usize) i32 {
fn climbingStairsDP(comptime n: usize) i32 {
// 已知 dp[1] 和 dp[2] ，返回之
if (n == 1 or n == 2) {
return @intCast(n);
@@ -23,7 +23,7 @@ fn climbing_stairs_dp(comptime n: usize) i32 {
}
// 爬楼梯：状态压缩后的动态规划
fn climbing_stairs_dp_comp(comptime n: usize) i32 {
fn climbingStairsDPComp(comptime n: usize) i32 {
if (n == 1 or n == 2) {
return @intCast(n);
}
@@ -41,10 +41,10 @@ fn climbing_stairs_dp_comp(comptime n: usize) i32 {
pub fn main() !void {
comptime var n: usize = 9;
var res = climbing_stairs_dp(n);
var res = climbingStairsDP(n);
std.debug.print("爬 {} 阶楼梯共有 {} 种方案\n", .{ n, res });
res = climbing_stairs_dp_comp(n);
res = climbingStairsDPComp(n);
std.debug.print("爬 {} 阶楼梯共有 {} 种方案\n", .{ n, res });
_ = try std.io.getStdIn().reader().readByte();