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

Update the coding style for Zig (#336)

Browse Source 
* Update the coding style for Zig

* Update array.rs
This commit is contained in:
sjinzh
2023-02-06 01:14:03 +08:00
committed by GitHub
parent cb73007495
commit 063501068b
26 changed files with 40 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/zig/chapter_stack_and_queue/array_queue.zig
View File

@@ -124,8 +124,8 @@ pub fn main() !void {
std.debug.print("\n队列长度 size = {}", .{size});
// 判断队列是否为空
var isEmpty = queue.isEmpty();
std.debug.print("\n队列是否为空 = {}", .{isEmpty});
var is_empty = queue.isEmpty();
std.debug.print("\n队列是否为空 = {}", .{is_empty});
// 测试环形数组
var i: i32 = 0;

14
codes/zig/chapter_stack_and_queue/array_stack.zig
View File

@@ -6,7 +6,6 @@ const std = @import("std");
const inc = @import("include");
// 基于数组实现的栈
// 编译期泛型
pub fn ArrayStack(comptime T: type) type {
return struct {
const Self = @This();
@@ -78,11 +77,11 @@ pub fn main() !void {
inc.PrintUtil.printList(i32, stack.toList());
// 访问栈顶元素
var top = stack.top();
std.debug.print("\n栈顶元素 top = {}", .{top});
var peek = stack.top();
std.debug.print("\n栈顶元素 peek = {}", .{peek});
// 元素出栈
top = stack.pop();
var top = stack.pop();
std.debug.print("\n出栈元素 pop = {}，出栈后 stack = ", .{top});
inc.PrintUtil.printList(i32, stack.toList());
@@ -91,9 +90,8 @@ pub fn main() !void {
std.debug.print("\n栈的长度 size = {}", .{size});
// 判断栈是否为空
var empty = stack.empty();
std.debug.print("\n栈是否为空 = {}", .{empty});
var is_empty = stack.empty();
std.debug.print("\n栈是否为空 = {}", .{is_empty});
const getchar = try std.io.getStdIn().reader().readByte();
_ = getchar;
_ = try std.io.getStdIn().reader().readByte();
}

4
codes/zig/chapter_stack_and_queue/deque.zig
View File

@@ -44,8 +44,8 @@ pub fn main() !void {
std.debug.print("\n双向队列长度 size = {}", .{size});
// 判断双向队列是否为空
var isEmpty = if (deque.len == 0) true else false;
std.debug.print("\n双向队列是否为空 = {}", .{isEmpty});
var is_empty = if (deque.len == 0) true else false;
std.debug.print("\n双向队列是否为空 = {}", .{is_empty});
_ = try std.io.getStdIn().reader().readByte();
}

4
codes/zig/chapter_stack_and_queue/linkedlist_deque.zig
View File

@@ -222,8 +222,8 @@ pub fn main() !void {
std.debug.print("\n队列长度 size = {}", .{size});
// 判断双向队列是否为空
var isEmpty = deque.isEmpty();
std.debug.print("\n双向队列是否为空 = {}", .{isEmpty});
var is_empty = deque.isEmpty();
std.debug.print("\n双向队列是否为空 = {}", .{is_empty});
_ = try std.io.getStdIn().reader().readByte();
}

4
codes/zig/chapter_stack_and_queue/linkedlist_queue.zig
View File

@@ -120,8 +120,8 @@ pub fn main() !void {
std.debug.print("\n队列长度 size = {}", .{size});
// 判断队列是否为空
var isEmpty = queue.isEmpty();
std.debug.print("\n队列是否为空 = {}", .{isEmpty});
var is_empty = queue.isEmpty();
std.debug.print("\n队列是否为空 = {}", .{is_empty});
_ = try std.io.getStdIn().reader().readByte();
}

8
codes/zig/chapter_stack_and_queue/linkedlist_stack.zig
View File

@@ -6,7 +6,6 @@ const std = @import("std");
const inc = @import("include");
// 基于链表实现的栈
// 编译期泛型
pub fn LinkedListStack(comptime T: type) type {
return struct {
const Self = @This();
@@ -111,10 +110,9 @@ pub fn main() !void {
std.debug.print("\n栈的长度 size = {}", .{size});
// 判断栈是否为空
var empty = stack.empty();
std.debug.print("\n栈是否为空 = {}", .{empty});
var is_empty = stack.empty();
std.debug.print("\n栈是否为空 = {}", .{is_empty});
const getchar = try std.io.getStdIn().reader().readByte();
_ = getchar;
_ = try std.io.getStdIn().reader().readByte();
}

4
codes/zig/chapter_stack_and_queue/queue.zig
View File

@@ -39,8 +39,8 @@ pub fn main() !void {
std.debug.print("\n队列长度 size = {}", .{size});
// 判断队列是否为空
var empty = if (queue.len == 0) true else false;
std.debug.print("\n队列是否为空 = {}", .{empty});
var is_empty = if (queue.len == 0) true else false;
std.debug.print("\n队列是否为空 = {}", .{is_empty});
_ = try std.io.getStdIn().reader().readByte();
}

3
codes/zig/chapter_stack_and_queue/stack.zig
View File

@@ -39,6 +39,5 @@ pub fn main() !void {
var empty = if (stack.items.len == 0) true else false;
std.debug.print("\n栈是否为空 = {}", .{empty});
const getchar = try std.io.getStdIn().reader().readByte();
_ = getchar;
_ = try std.io.getStdIn().reader().readByte();
}