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

Update the book based on the revised second edition (#1014)

Browse Source 
* Revised the book

* Update the book with the second revised edition

* Revise base on the manuscript of the first edition
This commit is contained in:
Yudong Jin
2023-12-28 18:06:09 +08:00
committed by GitHub
parent 19dde675df
commit f68bbb0d59
261 changed files with 643 additions and 647 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -55,10 +55,10 @@ pub fn ArrayQueue(comptime T: type) type {
std.debug.print("队列已满\n", .{});
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
// 计算队尾指针，指向队尾索引 + 1
// 通过取余操作实现 rear 越过数组尾部后回到头部
var rear = (self.front + self.queSize) % self.capacity();
// 尾节点后添加 num
// 在尾节点后添加 num
self.nums[rear] = num;
self.queSize += 1;
}
@@ -66,7 +66,7 @@ pub fn ArrayQueue(comptime T: type) type {
// 出队
pub fn pop(self: *Self) T {
var num = self.peek();
// 队首指针向后移动一位，若越过尾部则返回到数组头部
// 队首指针向后移动一位，若越过尾部，则返回到数组头部
self.front = (self.front + 1) % self.capacity();
self.queSize -= 1;
return num;