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

refactor: Replace poll with pop in Queue and Deque (#415)

Browse Source
This commit is contained in:
Yudong Jin
2023-03-13 21:58:21 +08:00
committed by GitHub
parent 2d17ee8e92
commit 8aebbaad21
77 changed files with 261 additions and 261 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -32,11 +32,11 @@ pub fn main() !void {
std.debug.print("\n队尾元素 peekLast = {}", .{peekLast});
// 元素出队
var pollFirst = deque.popFirst().?.data; // 队首元素出队
std.debug.print("\n队首出队元素 pollFirst = {}，队首出队后 deque = ", .{pollFirst});
var popFirst = deque.popFirst().?.data; // 队首元素出队
std.debug.print("\n队首出队元素 popFirst = {}，队首出队后 deque = ", .{popFirst});
inc.PrintUtil.printQueue(i32, deque);
var pollLast = deque.pop().?.data; // 队尾元素出队
std.debug.print("\n队尾出队元素 pollLast = {}，队尾出队后 deque = ", .{pollLast});
var popLast = deque.pop().?.data; // 队尾元素出队
std.debug.print("\n队尾出队元素 popLast = {}，队尾出队后 deque = ", .{popLast});
inc.PrintUtil.printQueue(i32, deque);
// 获取双向队列的长度