xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-26 15:26:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

update zig codes for Section 'Heap' (heap.zig)

Browse source
This commit is contained in:
sjinzh 2023-01-16 05:30:46 +08:00
parent 87949f6c20
commit 58d5c117f8
3 changed files with 7 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
codes/zig/chapter_heap/heap.zig
View file

@ -14,17 +14,16 @@ fn greaterThan(context: void, a: i32, b: i32) std.math.Order {
return lessThan(context, a, b).invert(); return lessThan(context, a, b).invert();
} }
fn testPush(comptime T: type, mem_allocator: std.mem.Allocator, heap_push: anytype, val: T) !void { fn testPush(comptime T: type, mem_allocator: std.mem.Allocator, heap: anytype, val: T) !void {
var heap = heap_push;
try heap.add(val); //元素入堆 try heap.add(val); //元素入堆
std.debug.print("\n元素 {} 入堆后\n", .{val}); std.debug.print("\n元素 {} 入堆后\n", .{val});
try inc.PrintUtil.printHeap(T, mem_allocator, heap); try inc.PrintUtil.printHeap(T, mem_allocator, heap);
} }
fn testPop(comptime T: type, mem_allocator: std.mem.Allocator, heap_pop: anytype) !void { fn testPop(comptime T: type, mem_allocator: std.mem.Allocator, heap: anytype) !void {
var val = heap_pop.remove(); //堆顶元素出堆 var val = heap.remove(); //堆顶元素出堆
std.debug.print("\n堆顶元素 {} 出堆后\n", .{val}); std.debug.print("\n堆顶元素 {} 出堆后\n", .{val});
try inc.PrintUtil.printHeap(T, mem_allocator, heap_pop); try inc.PrintUtil.printHeap(T, mem_allocator, heap);
} }
// Driver Code // Driver Code

2
codes/zig/include/PrintUtil.zig
View file

@ -65,7 +65,7 @@ pub fn printHeap(comptime T: type, mem_allocator: std.mem.Allocator, queue: anyt
std.debug.print("堆的数组表示：", .{}); std.debug.print("堆的数组表示：", .{});
printArray(T, arr[0..len]); printArray(T, arr[0..len]);
std.debug.print("\n堆的树状表示：\n", .{}); std.debug.print("\n堆的树状表示：\n", .{});
var root = try TreeUtil.arrQueToTree(T, mem_allocator, arr[0..len]); // through TailQueue var root = try TreeUtil.arrToTree(T, mem_allocator, arr[0..len]); // through TailQueue
try printTree(root, null, false); try printTree(root, null, false);
} }

4
codes/zig/include/TreeNode.zig
View file

@ -23,8 +23,8 @@ pub fn TreeNode(comptime T: type) type {
}; };
} }
// Generate a binary tree with an array (through TailQueue) // Generate a binary tree with an array
pub fn arrQueToTree(comptime T: type, mem_allocator: std.mem.Allocator, arr: []T) !?*TreeNode(T) { pub fn arrToTree(comptime T: type, mem_allocator: std.mem.Allocator, arr: []T) !?*TreeNode(T) {
if (arr.len == 0) return null; if (arr.len == 0) return null;
var root = try mem_allocator.create(TreeNode(T)); var root = try mem_allocator.create(TreeNode(T));
root.init(arr[0]); root.init(arr[0]);