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

upgrade zig codes to 0.11.0-dev.3379+629f0d23b (#563)

Browse Source 
* upgrade zig codes to 0.11.0-dev.3379+629f0d23b

* upgrade zig codes to 0.11.0-dev.3379+629f0d23b
This commit is contained in:
sjinzh
2023-06-25 20:59:00 +08:00
committed by GitHub
parent 62e8f0df50
commit 41b7b229a3
22 changed files with 264 additions and 460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/zig/chapter_array_and_linkedlist/array.zig
View File

@@ -18,7 +18,7 @@ pub fn randomAccess(nums: []i32) i32 {
pub fn extend(mem_allocator: std.mem.Allocator, nums: []i32, enlarge: usize) ![]i32 {
// 初始化一个扩展长度后的数组
var res = try mem_allocator.alloc(i32, nums.len + enlarge);
std.mem.set(i32, res, 0);
@memset(res, 0);
// 将原数组中的所有元素复制到新数组
std.mem.copy(i32, res, nums);
// 返回扩展后的新数组
@@ -62,7 +62,7 @@ pub fn traverse(nums: []i32) void {
// 在数组中查找指定元素
pub fn find(nums: []i32, target: i32) i32 {
for (nums) |num, i| {
for (nums, 0..) |num, i| {
if (num == target) return @intCast(i32, i);
}
return -1;

2
codes/zig/chapter_array_and_linkedlist/list.zig
View File

@@ -70,7 +70,7 @@ pub fn main() !void {
inc.PrintUtil.printList(i32, list);
// 排序列表
std.sort.sort(i32, list.items, {}, comptime std.sort.asc(i32));
std.mem.sort(i32, list.items, {}, comptime std.sort.asc(i32));
std.debug.print("\n排序列表后 list = ", .{});
inc.PrintUtil.printList(i32, list);

36
codes/zig/chapter_array_and_linkedlist/my_list.zig
View File

@@ -11,23 +11,23 @@ pub fn MyList(comptime T: type) type {
const Self = @This();
nums: []T = undefined, // 数组（存储列表元素）
nums_capacity: usize = 10, // 列表容量
num_size: usize = 0, // 列表长度（即当前元素数量）
extend_ratio: usize = 2, // 每次列表扩容的倍数
numsCapacity: usize = 10, // 列表容量
numSize: usize = 0, // 列表长度（即当前元素数量）
extendRatio: usize = 2, // 每次列表扩容的倍数
mem_arena: ?std.heap.ArenaAllocator = null,
mem_allocator: std.mem.Allocator = undefined, // 内存分配器
// 构造方法（分配内存+初始化列表）
// 构造函数（分配内存+初始化列表）
pub fn init(self: *Self, allocator: std.mem.Allocator) !void {
if (self.mem_arena == null) {
self.mem_arena = std.heap.ArenaAllocator.init(allocator);
self.mem_allocator = self.mem_arena.?.allocator();
}
self.nums = try self.mem_allocator.alloc(T, self.nums_capacity);
std.mem.set(T, self.nums, @as(T, 0));
self.nums = try self.mem_allocator.alloc(T, self.numsCapacity);
@memset(self.nums, @as(T, 0));
}
// 析构方法（释放内存）
// 析构函数（释放内存）
pub fn deinit(self: *Self) void {
if (self.mem_arena == null) return;
self.mem_arena.?.deinit();
@@ -35,12 +35,12 @@ pub fn MyList(comptime T: type) type {
// 获取列表长度（即当前元素数量）
pub fn size(self: *Self) usize {
return self.num_size;
return self.numSize;
}
// 获取列表容量
pub fn capacity(self: *Self) usize {
return self.nums_capacity;
return self.numsCapacity;
}
// 访问元素
@@ -63,7 +63,7 @@ pub fn MyList(comptime T: type) type {
if (self.size() == self.capacity()) try self.extendCapacity();
self.nums[self.size()] = num;
// 更新元素数量
self.num_size += 1;
self.numSize += 1;
}
// 中间插入元素
@@ -78,7 +78,7 @@ pub fn MyList(comptime T: type) type {
}
self.nums[index] = num;
// 更新元素数量
self.num_size += 1;
self.numSize += 1;
}
// 删除元素
@@ -91,30 +91,30 @@ pub fn MyList(comptime T: type) type {
self.nums[j] = self.nums[j + 1];
}
// 更新元素数量
self.num_size -= 1;
self.numSize -= 1;
// 返回被删除元素
return num;
}
// 列表扩容
pub fn extendCapacity(self: *Self) !void {
// 新建一个长度为原数组 extendRatio 倍的新数组，并将原数组拷贝到新数组
var newCapacity = self.capacity() * self.extend_ratio;
// 新建一个长度为 size * extendRatio 的数组，并将原数组拷贝到新数组
var newCapacity = self.capacity() * self.extendRatio;
var extend = try self.mem_allocator.alloc(T, newCapacity);
std.mem.set(T, extend, @as(T, 0));
@memset(extend, @as(T, 0));
// 将原数组中的所有元素复制到新数组
std.mem.copy(T, extend, self.nums);
self.nums = extend;
// 更新列表容量
self.nums_capacity = newCapacity;
self.numsCapacity = newCapacity;
}
// 将列表转换为数组
pub fn toArray(self: *Self) ![]T {
// 仅转换有效长度范围内的列表元素
var nums = try self.mem_allocator.alloc(T, self.size());
std.mem.set(T, nums, @as(T, 0));
for (nums) |*num, i| {
@memset(nums, @as(T, 0));
for (nums, 0..) |*num, i| {
num.* = self.get(i);
}
return nums;