add rust codes for chapter queue

coderonion · coderonion · commit ff917b8a8712 · 2023-02-05T13:15:37.000+08:00
diff --git a/c/chapter_array_and_linkedlist/my_list.c b/c/chapter_array_and_linkedlist/my_list.c
diff --git a/rust/Cargo.toml b/rust/Cargo.toml
@@ -37,6 +37,11 @@ path = "chapter_array_and_linkedlist/list.rs"
 name = "stack"
 path = "chapter_stack_and_queue/stack.rs"
 
+# Run Command: cargo run --bin queue
+[[bin]]
+name = "queue"
+path = "chapter_stack_and_queue/queue.rs"
+
 # Run Command: cargo run --bin hash_map
 [[bin]]
 name = "hash_map"
diff --git a/rust/chapter_stack_and_queue/queue.rs b/rust/chapter_stack_and_queue/queue.rs
@@ -0,0 +1,39 @@
+/**
+ * File: queue.rs
+ * Created Time: 2023-02-05
+ * Author: sjinzh (sjinzh@gmail.com)
+*/
+
+use std::collections::LinkedList;
+
+/* Driver Code */
+pub fn main() {
+    // 初始化队列
+    let mut queue: LinkedList<i32> = LinkedList::new();
+
+    // 元素入队
+    queue.push_back(1);
+    queue.push_back(3);
+    queue.push_back(2);
+    queue.push_back(5);
+    queue.push_back(4);
+    print!("队列 queue = ");
+    inc::print_util::print_queue(&queue);
+
+    // 访问队首元素
+    let peek = queue.front().unwrap();
+    println!("\n队首元素 peek = {peek}");
+
+    // 元素出队
+    let poll = queue.pop_front().unwrap();
+    print!("出队元素 poll = {poll}，出队后 queue = ");
+    inc::print_util::print_queue(&queue);
+
+    // 获取队列的长度
+    let size = queue.len();
+    print!("\n队列长度 size = {size}");
+
+    /* 判断队列是否为空 */
+    let is_empty = queue.is_empty();
+    print!("\n队列是否为空 = {is_empty}");
+}
diff --git a/rust/chapter_stack_and_queue/stack.rs b/rust/chapter_stack_and_queue/stack.rs
@@ -33,6 +33,6 @@ pub fn main() {
     print!("\n栈的长度 size = {size}");
 
     // 判断栈是否为空
-    let empty = stack.is_empty();
-    print!("\n栈是否为空 = {empty}");
+    let is_empty = stack.is_empty();
+    print!("\n栈是否为空 = {is_empty}");
 }
diff --git a/rust/include/print_util.rs b/rust/include/print_util.rs
@@ -6,6 +6,7 @@
 
 use std::fmt::Display;
 use std::collections::HashMap;
+use std::collections::LinkedList;
 
 /* Print an array */
 pub fn print_array<T: Display>(nums: &[T]) {
@@ -24,4 +25,13 @@ pub fn print_hash_map<TKey: Display, TValue: Display>(map: &HashMap<TKey, TValue
     for (key, value) in map {
         println!("{key} -> {value}");
     }
+}
+
+/* Print a queue or deque */
+pub fn print_queue<T: Display>(queue: &LinkedList<T>) {
+    print!("[");
+    let iter = queue.iter();
+    for (i, data) in iter.enumerate() {
+        print!("{}{}", data, if i == queue.len() - 1 {"]"} else {", "} );
+    }
 }
diff --git a/zig/chapter_stack_and_queue/queue.zig b/zig/chapter_stack_and_queue/queue.zig
@@ -30,12 +30,12 @@ pub fn main() !void {
     inc.PrintUtil.printQueue(i32, queue);
 
     // 访问队首元素
-    var front = queue.first.?.data;
-    std.debug.print("\n队首元素 front = {}", .{front});
+    var peek = queue.first.?.data;
+    std.debug.print("\n队首元素 peek = {}", .{peek});
 
     // 元素出队
-    front = queue.popFirst().?.data;
-    std.debug.print("\n出队元素 front = {}，出队后 queue = ", .{front});
+    var poll = queue.popFirst().?.data;
+    std.debug.print("\n出队元素 poll = {}，出队后 queue = ", .{poll});
     inc.PrintUtil.printQueue(i32, queue);
 
     // 获取队列的长度

Original file line number	Diff line number	Diff line change
`@@ -33,6 +33,6 @@ pub fn main() {`
`33`	`33`	`print!("\n栈的长度 size = {size}");`
`34`	`34`
`35`	`35`	`// 判断栈是否为空`
`36`		`- let empty = stack.is_empty();`
`37`		`- print!("\n栈是否为空 = {empty}");`
	`36`	`+ let is_empty = stack.is_empty();`
	`37`	`+ print!("\n栈是否为空 = {is_empty}");`
`38`	`38`	`}`