algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

copy zig codes of chapter_array_and_linkedlist and chapter_computatio… (#319)

Browse Source 
* copy zig codes of chapter_array_and_linkedlist and chapter_computational_complexity to markdown files

* Update time_complexity.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
sjinzh
2023-02-03 19:15:34 +08:00
committed by GitHub
parent b39b84acba
commit 15efaca85d
8 changed files with 566 additions and 41 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -70,26 +70,27 @@ pub fn find(nums: []i32, target: i32) i32 {
// Driver Code
pub fn main() !void {
// 初始化内存分配器
var mem_arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
defer mem_arena.deinit();
const mem_allocator = mem_arena.allocator();
// 初始化数组
const size: i32 = 5;
var arr = [_]i32{0} ** size;
var arr = [_]i32{0} ** 5;
std.debug.print("数组 arr = ", .{});
inc.PrintUtil.printArray(i32, &arr);
var array = [_]i32{ 1, 3, 2, 5, 4 };
var known_at_runtime_zero: usize = 0;
var nums = array[known_at_runtime_zero..];
std.debug.print("\n数组 nums = ", .{});
inc.PrintUtil.printArray(i32, &array);
inc.PrintUtil.printArray(i32, nums);
// 随机访问
var randomNum = randomAccess(&array);
var randomNum = randomAccess(nums);
std.debug.print("\n在 nums 中获取随机元素 {}", .{randomNum});
// 长度扩展
var known_at_runtime_zero: usize = 0;
var nums: []i32 = array[known_at_runtime_zero..array.len];
var mem_arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
defer mem_arena.deinit();
const mem_allocator = mem_arena.allocator();
nums = try extend(mem_allocator, nums, 3);
std.debug.print("\n将数组长度扩展至 8 ，得到 nums = ", .{});
inc.PrintUtil.printArray(i32, nums);

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

@@ -44,8 +44,7 @@ pub fn main() !void {
inc.PrintUtil.printList(i32, list);
// 删除元素
var value = list.orderedRemove(3);
_ = value;
_ = list.orderedRemove(3);
std.debug.print("\n删除索引 3 处的元素，得到 list = ", .{});
inc.PrintUtil.printList(i32, list);