xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-08 05:26:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
sjinzh
2023-01-14 22:28:23 +08:00
parent 92b7aecf70
commit 5bda3dd91f
3 changed files with 107 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/zig/include/TreeNode.zig
+8 -14
View File
@@ -28,32 +28,26 @@ pub fn arrToTree(comptime T: type, mem_allocator: std.mem.Allocator, list: []T)
if (list.len == 0) return null;
var root = try mem_allocator.create(TreeNode(T));
root.init(list[0]);
const TailQueue = std.TailQueue(?*TreeNode(T));
const TailQueueNode = std.TailQueue(?*TreeNode(T)).Node;
var que = TailQueue{};
var node_root = TailQueueNode{ .data = root };
que.append(&node_root);
var que = std.ArrayList(*TreeNode(T)).init(std.heap.page_allocator);
try que.append(root);
var index: usize = 0;
while (que.len > 0) {
var node = que.popFirst();
while (que.items.len > 0) {
var node = que.orderedRemove(0);
index += 1;
if (index >= list.len) break;
if (index < list.len) {
var tmp = try mem_allocator.create(TreeNode(T));
tmp.init(list[index]);
node.?.data.?.left = tmp;
var a = TailQueueNode{ .data = node.?.data.?.left };
que.append(&a);
node.left = tmp;
try que.append(node.left.?);
}
index += 1;
if (index >= list.len) break;
if (index < list.len) {
var tmp = try mem_allocator.create(TreeNode(T));
tmp.init(list[index]);
node.?.data.?.right = tmp;
var a = TailQueueNode{ .data = node.?.data.?.right };
que.append(&a);
node.right = tmp;
try que.append(node.right.?);
}
}
return root;