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

🚀feat: add rust codes for array_deque (#418)

Browse Source 
* update zig codes style

* feat: add rust codes for array_deque

* Update array_deque.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
sjinzh
2023-03-14 20:45:27 +08:00
committed by GitHub
parent 567497a6b8
commit c2be6ebfbe
7 changed files with 235 additions and 73 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/zig/chapter_heap/heap.zig
+19 -19
View File
@@ -36,45 +36,45 @@ pub fn main() !void {
// 初始化堆
// 初始化小顶堆
const PQlt = std.PriorityQueue(i32, void, lessThan);
var minHeap = PQlt.init(std.heap.page_allocator, {});
defer minHeap.deinit();
var min_heap = PQlt.init(std.heap.page_allocator, {});
defer min_heap.deinit();
// 初始化大顶堆
const PQgt = std.PriorityQueue(i32, void, greaterThan);
var maxHeap = PQgt.init(std.heap.page_allocator, {});
defer maxHeap.deinit();
var max_heap = PQgt.init(std.heap.page_allocator, {});
defer max_heap.deinit();
std.debug.print("\n以下测试样例为大顶堆", .{});
// 元素入堆
try testPush(i32, mem_allocator, &maxHeap, 1);
try testPush(i32, mem_allocator, &maxHeap, 3);
try testPush(i32, mem_allocator, &maxHeap, 2);
try testPush(i32, mem_allocator, &maxHeap, 5);
try testPush(i32, mem_allocator, &maxHeap, 4);
try testPush(i32, mem_allocator, &max_heap, 1);
try testPush(i32, mem_allocator, &max_heap, 3);
try testPush(i32, mem_allocator, &max_heap, 2);
try testPush(i32, mem_allocator, &max_heap, 5);
try testPush(i32, mem_allocator, &max_heap, 4);
// 获取堆顶元素
var peek = maxHeap.peek().?;
var peek = max_heap.peek().?;
std.debug.print("\n堆顶元素为 {}\n", .{peek});
// 堆顶元素出堆
try testPop(i32, mem_allocator, &maxHeap);
try testPop(i32, mem_allocator, &maxHeap);
try testPop(i32, mem_allocator, &maxHeap);
try testPop(i32, mem_allocator, &maxHeap);
try testPop(i32, mem_allocator, &maxHeap);
try testPop(i32, mem_allocator, &max_heap);
try testPop(i32, mem_allocator, &max_heap);
try testPop(i32, mem_allocator, &max_heap);
try testPop(i32, mem_allocator, &max_heap);
try testPop(i32, mem_allocator, &max_heap);
// 获取堆的大小
var size = maxHeap.len;
var size = max_heap.len;
std.debug.print("\n堆元素数量为 {}\n", .{size});
// 判断堆是否为空
var is_empty = if (maxHeap.len == 0) true else false;
var is_empty = if (max_heap.len == 0) true else false;
std.debug.print("\n堆是否为空 {}\n", .{is_empty});
// 输入列表并建堆
try minHeap.addSlice(&[_]i32{ 1, 3, 2, 5, 4 });
try min_heap.addSlice(&[_]i32{ 1, 3, 2, 5, 4 });
std.debug.print("\n输入列表并建立小顶堆后\n", .{});
try inc.PrintUtil.printHeap(i32, mem_allocator, minHeap);
try inc.PrintUtil.printHeap(i32, mem_allocator, min_heap);
_ = try std.io.getStdIn().reader().readByte();
}