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

🚀feat: add rust codes for array_deque (#418)

Browse Source 
* update zig codes style

* feat: add rust codes for array_deque

* Update array_deque.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
sjinzh
2023-03-14 20:45:27 +08:00
committed by GitHub
parent 567497a6b8
commit c2be6ebfbe
7 changed files with 235 additions and 73 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -13,7 +13,7 @@ pub fn ArrayQueue(comptime T: type) type {
nums: []T = undefined, // 用于存储队列元素的数组
cap: usize = 0, // 队列容量
front: usize = 0, // 队首指针，指向队首元素
queSize: usize = 0, // 尾指针，指向队尾 + 1
que_size: usize = 0, // 尾指针，指向队尾 + 1
mem_arena: ?std.heap.ArenaAllocator = null,
mem_allocator: std.mem.Allocator = undefined, // 内存分配器
@@ -41,12 +41,12 @@ pub fn ArrayQueue(comptime T: type) type {
// 获取队列的长度
pub fn size(self: *Self) usize {
return self.queSize;
return self.que_size;
}
// 判断队列是否为空
pub fn isEmpty(self: *Self) bool {
return self.queSize == 0;
return self.que_size == 0;
}
// 入队
@@ -57,10 +57,10 @@ pub fn ArrayQueue(comptime T: type) type {
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
var rear = (self.front + self.queSize) % self.capacity();
var rear = (self.front + self.que_size) % self.capacity();
// 将 num 添加至队尾
self.nums[rear] = num;
self.queSize += 1;
self.que_size += 1;
}
// 出队
@@ -68,7 +68,7 @@ pub fn ArrayQueue(comptime T: type) type {
var num = self.peek();
// 队首指针向后移动一位，若越过尾部则返回到数组头部
self.front = (self.front + 1) % self.capacity();
self.queSize -= 1;
self.que_size -= 1;
return num;
}

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

@@ -26,17 +26,17 @@ pub fn main() !void {
inc.PrintUtil.printQueue(i32, deque);
// 访问元素
var peekFirst = deque.first.?.data; // 队首元素
std.debug.print("\n队首元素 peekFirst = {}", .{peekFirst});
var peekLast = deque.last.?.data; // 队尾元素
std.debug.print("\n队尾元素 peekLast = {}", .{peekLast});
var peek_first = deque.first.?.data; // 队首元素
std.debug.print("\n队首元素 peek_first = {}", .{peek_first});
var peek_last = deque.last.?.data; // 队尾元素
std.debug.print("\n队尾元素 peek_last = {}", .{peek_last});
// 元素出队
var popFirst = deque.popFirst().?.data; // 队首元素出队
std.debug.print("\n队首出队元素 popFirst = {}，队首出队后 deque = ", .{popFirst});
var pop_first = deque.popFirst().?.data; // 队首元素出队
std.debug.print("\n队首出队元素 pop_first = {}，队首出队后 deque = ", .{pop_first});
inc.PrintUtil.printQueue(i32, deque);
var popLast = deque.pop().?.data; // 队尾元素出队
std.debug.print("\n队尾出队元素 popLast = {}，队尾出队后 deque = ", .{popLast});
var pop_last = deque.pop().?.data; // 队尾元素出队
std.debug.print("\n队尾出队元素 pop_last = {}，队尾出队后 deque = ", .{pop_last});
inc.PrintUtil.printQueue(i32, deque);
// 获取双向队列的长度