mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-26 04:56:06 +00:00
build
This commit is contained in:
krahets
@@ -2372,121 +2372,157 @@ comments: true
|
||||
|
||||
```zig title="my_list.zig"
|
||||
// 串列類別
|
||||
fn MyList(comptime T: type) type {
|
||||
return struct {
|
||||
const Self = @This();
|
||||
|
||||
arr: []T = undefined, // 陣列（儲存串列元素）
|
||||
arrCapacity: usize = 10, // 串列容量
|
||||
numSize: usize = 0, // 串列長度（當前元素數量）
|
||||
extendRatio: usize = 2, // 每次串列擴容的倍數
|
||||
mem_arena: ?std.heap.ArenaAllocator = null,
|
||||
mem_allocator: std.mem.Allocator = undefined, // 記憶體分配器
|
||||
const MyList = struct {
|
||||
const Self = @This();
|
||||
|
||||
// 建構子（分配記憶體+初始化串列）
|
||||
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.arr = try self.mem_allocator.alloc(T, self.arrCapacity);
|
||||
@memset(self.arr, @as(T, 0));
|
||||
}
|
||||
items: []i32, // 陣列（儲存串列元素）
|
||||
capacity: usize, // 串列容量
|
||||
allocator: std.mem.Allocator, // 記憶體分配器
|
||||
|
||||
// 析構函式（釋放記憶體）
|
||||
pub fn deinit(self: *Self) void {
|
||||
if (self.mem_arena == null) return;
|
||||
self.mem_arena.?.deinit();
|
||||
}
|
||||
extend_ratio: usize = 2, // 每次串列擴容的倍數
|
||||
|
||||
// 獲取串列長度（當前元素數量）
|
||||
pub fn size(self: *Self) usize {
|
||||
return self.numSize;
|
||||
}
|
||||
// 建構子（分配記憶體+初始化串列）
|
||||
pub fn init(allocator: std.mem.Allocator) Self {
|
||||
return Self{
|
||||
.items = &[_]i32{},
|
||||
.capacity = 0,
|
||||
.allocator = allocator,
|
||||
};
|
||||
}
|
||||
|
||||
// 獲取串列容量
|
||||
pub fn capacity(self: *Self) usize {
|
||||
return self.arrCapacity;
|
||||
}
|
||||
// 析構函式（釋放記憶體）
|
||||
pub fn deinit(self: Self) void {
|
||||
self.allocator.free(self.allocatedSlice());
|
||||
}
|
||||
|
||||
// 訪問元素
|
||||
pub fn get(self: *Self, index: usize) T {
|
||||
// 索引如果越界，則丟擲異常，下同
|
||||
if (index < 0 or index >= self.size()) @panic("索引越界");
|
||||
return self.arr[index];
|
||||
}
|
||||
// 在尾部新增元素
|
||||
pub fn add(self: *Self, item: i32) !void {
|
||||
// 元素數量超出容量時，觸發擴容機制
|
||||
const newlen = self.items.len + 1;
|
||||
try self.ensureTotalCapacity(newlen);
|
||||
|
||||
// 更新元素
|
||||
pub fn set(self: *Self, index: usize, num: T) void {
|
||||
// 索引如果越界，則丟擲異常，下同
|
||||
if (index < 0 or index >= self.size()) @panic("索引越界");
|
||||
self.arr[index] = num;
|
||||
}
|
||||
self.items.len += 1;
|
||||
const new_item_ptr = &self.items[self.items.len - 1];
|
||||
new_item_ptr.* = item;
|
||||
}
|
||||
|
||||
// 在尾部新增元素
|
||||
pub fn add(self: *Self, num: T) !void {
|
||||
// 元素數量超出容量時，觸發擴容機制
|
||||
if (self.size() == self.capacity()) try self.extendCapacity();
|
||||
self.arr[self.size()] = num;
|
||||
// 更新元素數量
|
||||
self.numSize += 1;
|
||||
}
|
||||
// 獲取串列長度（當前元素數量）
|
||||
pub fn getSize(self: *Self) usize {
|
||||
return self.items.len;
|
||||
}
|
||||
|
||||
// 在中間插入元素
|
||||
pub fn insert(self: *Self, index: usize, num: T) !void {
|
||||
if (index < 0 or index >= self.size()) @panic("索引越界");
|
||||
// 元素數量超出容量時，觸發擴容機制
|
||||
if (self.size() == self.capacity()) try self.extendCapacity();
|
||||
// 將索引 index 以及之後的元素都向後移動一位
|
||||
var j = self.size() - 1;
|
||||
while (j >= index) : (j -= 1) {
|
||||
self.arr[j + 1] = self.arr[j];
|
||||
// 獲取串列容量
|
||||
pub fn getCapacity(self: *Self) usize {
|
||||
return self.capacity;
|
||||
}
|
||||
|
||||
// 訪問元素
|
||||
pub fn get(self: *Self, index: usize) i32 {
|
||||
// 索引如果越界，則丟擲異常，下同
|
||||
if (index < 0 or index >= self.items.len) {
|
||||
@panic("索引越界");
|
||||
}
|
||||
return self.items[index];
|
||||
}
|
||||
|
||||
// 更新元素
|
||||
pub fn set(self: *Self, index: usize, num: i32) void {
|
||||
// 索引如果越界，則丟擲異常，下同
|
||||
if (index < 0 or index >= self.items.len) {
|
||||
@panic("索引越界");
|
||||
}
|
||||
self.items[index] = num;
|
||||
}
|
||||
|
||||
// 在中間插入元素
|
||||
pub fn insert(self: *Self, index: usize, item: i32) !void {
|
||||
if (index < 0 or index >= self.items.len) {
|
||||
@panic("索引越界");
|
||||
}
|
||||
|
||||
// 元素數量超出容量時，觸發擴容機制
|
||||
const newlen = self.items.len + 1;
|
||||
try self.ensureTotalCapacity(newlen);
|
||||
|
||||
// 將索引 index 以及之後的元素都向後移動一位
|
||||
self.items.len += 1;
|
||||
var i = self.items.len - 1;
|
||||
while (i >= index) : (i -= 1) {
|
||||
self.items[i] = self.items[i - 1];
|
||||
}
|
||||
self.items[index] = item;
|
||||
}
|
||||
|
||||
// 刪除元素
|
||||
pub fn remove(self: *Self, index: usize) i32 {
|
||||
if (index < 0 or index >= self.getSize()) {
|
||||
@panic("索引越界");
|
||||
}
|
||||
// 將索引 index 之後的元素都向前移動一位
|
||||
const item = self.items[index];
|
||||
var i = index;
|
||||
while (i < self.items.len - 1) : (i += 1) {
|
||||
self.items[i] = self.items[i + 1];
|
||||
}
|
||||
self.items.len -= 1;
|
||||
// 返回被刪除的元素
|
||||
return item;
|
||||
}
|
||||
|
||||
// 將串列轉換為陣列
|
||||
pub fn toArraySlice(self: *Self) ![]i32 {
|
||||
return self.toOwnedSlice(false);
|
||||
}
|
||||
|
||||
// 返回新的切片並設定是否要重置或清空串列容器
|
||||
pub fn toOwnedSlice(self: *Self, clear: bool) ![]i32 {
|
||||
const allocator = self.allocator;
|
||||
const old_memory = self.allocatedSlice();
|
||||
if (allocator.remap(old_memory, self.items.len)) |new_items| {
|
||||
if (clear) {
|
||||
self.* = init(allocator);
|
||||
}
|
||||
self.arr[index] = num;
|
||||
// 更新元素數量
|
||||
self.numSize += 1;
|
||||
return new_items;
|
||||
}
|
||||
|
||||
// 刪除元素
|
||||
pub fn remove(self: *Self, index: usize) T {
|
||||
if (index < 0 or index >= self.size()) @panic("索引越界");
|
||||
var num = self.arr[index];
|
||||
// 將索引 index 之後的元素都向前移動一位
|
||||
var j = index;
|
||||
while (j < self.size() - 1) : (j += 1) {
|
||||
self.arr[j] = self.arr[j + 1];
|
||||
}
|
||||
// 更新元素數量
|
||||
self.numSize -= 1;
|
||||
// 返回被刪除的元素
|
||||
return num;
|
||||
const new_memory = try allocator.alloc(i32, self.items.len);
|
||||
@memcpy(new_memory, self.items);
|
||||
if (clear) {
|
||||
self.clearAndFree();
|
||||
}
|
||||
return new_memory;
|
||||
}
|
||||
|
||||
// 串列擴容
|
||||
pub fn extendCapacity(self: *Self) !void {
|
||||
// 新建一個長度為 size * extendRatio 的陣列，並將原陣列複製到新陣列
|
||||
var newCapacity = self.capacity() * self.extendRatio;
|
||||
var extend = try self.mem_allocator.alloc(T, newCapacity);
|
||||
@memset(extend, @as(T, 0));
|
||||
// 將原陣列中的所有元素複製到新陣列
|
||||
std.mem.copy(T, extend, self.arr);
|
||||
self.arr = extend;
|
||||
// 更新串列容量
|
||||
self.arrCapacity = newCapacity;
|
||||
}
|
||||
// 串列擴容
|
||||
fn ensureTotalCapacity(self: *Self, new_capacity: usize) !void {
|
||||
if (self.capacity >= new_capacity) return;
|
||||
const capcacity = if (self.capacity == 0) 10 else self.capacity;
|
||||
const better_capacity = capcacity * self.extend_ratio;
|
||||
|
||||
// 將串列轉換為陣列
|
||||
pub fn toArray(self: *Self) ![]T {
|
||||
// 僅轉換有效長度範圍內的串列元素
|
||||
var arr = try self.mem_allocator.alloc(T, self.size());
|
||||
@memset(arr, @as(T, 0));
|
||||
for (arr, 0..) |*num, i| {
|
||||
num.* = self.get(i);
|
||||
}
|
||||
return arr;
|
||||
const old_memory = self.allocatedSlice();
|
||||
if (self.allocator.remap(old_memory, better_capacity)) |new_memory| {
|
||||
self.items.ptr = new_memory.ptr;
|
||||
self.capacity = new_memory.len;
|
||||
} else {
|
||||
const new_memory = try self.allocator.alloc(i32, better_capacity);
|
||||
@memcpy(new_memory[0..self.items.len], self.items);
|
||||
self.allocator.free(old_memory);
|
||||
self.items.ptr = new_memory.ptr;
|
||||
self.capacity = new_memory.len;
|
||||
}
|
||||
};
|
||||
}
|
||||
}
|
||||
|
||||
fn clearAndFree(self: *Self, allocator: std.mem.Allocator) void {
|
||||
allocator.free(self.allocatedSlice());
|
||||
self.items.len = 0;
|
||||
self.capacity = 0;
|
||||
}
|
||||
|
||||
fn allocatedSlice(self: Self) []i32 {
|
||||
return self.items.ptr[0..self.capacity];
|
||||
}
|
||||
};
|
||||
```
|
||||
|
||||
??? pythontutor "視覺化執行"
|
||||
|
||||
Reference in New Issue
Block a user