Refine some details and coding style for Rust codes (#344)

* Refine some details and coding style for Rust codes

* Update coding style for Rust codes

* Update time_complexity.rs

* Update array.rs

* Update leetcode_two_sum.rs

* Update hash_map.rs

* Update file headers

* Update coding style for Rust codes and Zig codes

* Update coding style for Rust codes and Zig codes

---------

Co-authored-by: Yudong Jin <krahets@163.com>

codes/rust/chapter_stack_and_queue/array_stack.rs

@@ -1,84 +1,85 @@
-/**
+/*
  * File: array_stack.rs
  * Created Time: 2023-02-05
- * Author: WSL0809 (wslzzy@outlook.com)
+ * Author: WSL0809 (wslzzy@outlook.com), sjinzh (sjinzh@gmail.com)
  */
 
-use std::vec::Vec;
-struct ArrayStack {
-    stack: Vec<i32>,
+include!("../include/include.rs");
+
+/* 基于数组实现的栈 */
+struct ArrayStack<T> {
+    stack: Vec<T>,
 }
 
-impl ArrayStack {
-    fn new() -> ArrayStack {
-        ArrayStack { stack: Vec::new() }
+impl<T> ArrayStack<T> {
+    /* 初始化栈 */
+    fn new() -> ArrayStack<T> {
+        ArrayStack::<T> { stack: Vec::<T>::new() }
     }
 
-    //获取栈的长度
+    /* 获取栈的长度 */
     fn size(&self) -> usize {
         self.stack.len()
     }
 
-    //判断栈是否为空
+    /* 判断栈是否为空 */
     fn is_empty(&self) -> bool {
         self.size() == 0
     }
 
-    //入栈
-    fn push(&mut self, num: i32) {
+    /* 入栈 */
+    fn push(&mut self, num: T) {
         self.stack.push(num);
     }
 
-    //出栈
-    fn pop(&mut self) -> i32 {
+    /* 出栈 */
+    fn pop(&mut self) -> Option<T> {
         match self.stack.pop() {
-            Some(num) => num,
-            None => panic!("stack is empty"),
+            Some(num) => Some(num),
+            None => None,
         }
     }
 
-    //访问栈顶元素
-    fn peek(&self) -> i32 {
-        *self
-            .stack
-            .last()
-            .unwrap_or_else(|| panic!("stack is empty"))
+    /* 访问栈顶元素 */
+    fn peek(&self) -> Option<&T> {
+        if self.is_empty() { panic!("栈为空") };
+        self.stack.last()
     }
 
-    fn to_vec(&self) -> Vec<i32> {
-        self.stack.clone()
+    /* 返回 &Vec */
+    fn to_array(&self) -> &Vec<T> {
+        &self.stack
     }
 }
 
+/* Driver Code */
 fn main() {
-    //初始化栈
-    let mut stack = ArrayStack::new();
+    // 初始化栈
+    let mut stack = ArrayStack::<i32>::new();
 
-    //元素入栈
+    // 元素入栈
     stack.push(1);
     stack.push(3);
     stack.push(2);
     stack.push(5);
     stack.push(4);
-    println!("栈 stack = {:?}", stack.to_vec());
+    print!("栈 stack = ");
+    print_util::print_array(stack.to_array());
 
     //访问栈顶元素
-    let peek = stack.peek();
-    println!("栈顶元素 peek = {}", peek);
+    let peek = stack.peek().unwrap();
+    print!("\n栈顶元素 peek = {}", peek);
 
-    //元素出栈
-    let pop = stack.pop();
-    println!(
-        "出栈元素 pop = {}，出栈后 stack = {:?}",
-        pop,
-        stack.to_vec()
-    );
+    // 元素出栈
+    let pop = stack.pop().unwrap();
+    print!("\n出栈元素 pop = {pop}，出栈后 stack = ");
+    print_util::print_array(stack.to_array());
 
-    //获取栈的长度
+    // 获取栈的长度
     let size = stack.size();
-    println!("栈的长度 size = {}", size);
+    print!("\n栈的长度 size = {size}");
 
-    //判断是否为空
+    // 判断是否为空
     let is_empty = stack.is_empty();
-    println!("栈是否为空 = {}", is_empty);
-}
+    print!("\n栈是否为空 = {is_empty}");
+}

codes/rust/chapter_stack_and_queue/deque.rs

@@ -1,8 +1,10 @@
-/**
+/*
  * File: deque.rs
  * Created Time: 2023-02-05
  * Author: sjinzh (sjinzh@gmail.com)
-*/
+ */
+
+include!("../include/include.rs");
 
 use std::collections::LinkedList;
 
@@ -16,7 +18,7 @@ pub fn main() {
     deque.push_front(3);    // 添加至队首
     deque.push_front(1);
     print!("双向队列 deque = ");
-    inc::print_util::print_queue(&deque);
+    print_util::print_queue(&deque);
 
     // 访问元素
     let peek_first = deque.front().unwrap();    // 队首元素
@@ -27,16 +29,16 @@ pub fn main() {
     // 元素出队
     let poll_first = deque.pop_front().unwrap();    // 队首元素出队
     print!("\n队首出队元素 pollFirst = {poll_first}，队首出队后 deque = ");
-    inc::print_util::print_queue(&deque);
+    print_util::print_queue(&deque);
     let poll_last = deque.pop_back().unwrap();      // 队尾元素出队     
     print!("\n队尾出队元素 pollLast = {poll_last}，队尾出队后 deque = ");
-    inc::print_util::print_queue(&deque);
+    print_util::print_queue(&deque);
 
     // 获取双向队列的长度
     let size = deque.len();
     print!("\n双向队列长度 size = {size}");
 
-    /* 判断双向队列是否为空 */
+    // 判断双向队列是否为空
     let is_empty = deque.is_empty();
     print!("\n双向队列是否为空 = {is_empty}");
 }

codes/rust/chapter_stack_and_queue/queue.rs

@@ -1,8 +1,10 @@
-/**
+/*
  * File: queue.rs
  * Created Time: 2023-02-05
  * Author: sjinzh (sjinzh@gmail.com)
-*/
+ */
+
+include!("../include/include.rs");
 
 use std::collections::LinkedList;
 
@@ -18,7 +20,7 @@ pub fn main() {
     queue.push_back(5);
     queue.push_back(4);
     print!("队列 queue = ");
-    inc::print_util::print_queue(&queue);
+    print_util::print_queue(&queue);
 
     // 访问队首元素
     let peek = queue.front().unwrap();
@@ -27,13 +29,13 @@ pub fn main() {
     // 元素出队
     let poll = queue.pop_front().unwrap();
     print!("出队元素 poll = {poll}，出队后 queue = ");
-    inc::print_util::print_queue(&queue);
+    print_util::print_queue(&queue);
 
     // 获取队列的长度
     let size = queue.len();
     print!("\n队列长度 size = {size}");
 
-    /* 判断队列是否为空 */
+    // 判断队列是否为空
     let is_empty = queue.is_empty();
     print!("\n队列是否为空 = {is_empty}");
 }

codes/rust/chapter_stack_and_queue/stack.rs

@@ -1,8 +1,10 @@
-/**
+/*
  * File: stack.rs
  * Created Time: 2023-02-05
  * Author: sjinzh (sjinzh@gmail.com)
-*/
+ */
+
+include!("../include/include.rs");
 
 /* Driver Code */
 pub fn main() {
@@ -17,7 +19,7 @@ pub fn main() {
     stack.push(5);
     stack.push(4);
     print!("栈 stack = ");
-    inc::print_util::print_array(&stack);
+    print_util::print_array(&stack);
 
     // 访问栈顶元素
     let peek = stack.get(stack.len() - 1).unwrap();
@@ -26,7 +28,7 @@ pub fn main() {
     // 元素出栈
     let pop = stack.pop().unwrap();
     print!("\n出栈元素 pop = {pop}，出栈后 stack = ");
-    inc::print_util::print_array(&stack);
+    print_util::print_array(&stack);
 
     // 获取栈的长度
     let size = stack.len();