update rust codes for hash_map, binary_search, bubble_sort, stack, queue (#330)

* update rust codes

* update rust codes

* update rust codes

* update and add rust codes for hash_map, binary_search, bubble_sort

* update and add rust codes for hash_map, binary_search, bubble_sort

* add rust codes for chapter stack

* add rust codes for chapter queue

* add rust codes for chapter deque

codes/rust/chapter_stack_and_queue/deque.rs

@@ -0,0 +1,42 @@
+/**
+ * File: deque.rs
+ * Created Time: 2023-02-05
+ * Author: sjinzh (sjinzh@gmail.com)
+*/
+
+use std::collections::LinkedList;
+
+/* Driver Code */
+pub fn main() {
+    // 初始化双向队列
+    let mut deque: LinkedList<i32> = LinkedList::new();
+    deque.push_back(2);     // 添加至队尾
+    deque.push_back(5);
+    deque.push_back(4);
+    deque.push_front(3);    // 添加至队首
+    deque.push_front(1);
+    print!("双向队列 deque = ");
+    inc::print_util::print_queue(&deque);
+
+    // 访问元素
+    let peek_first = deque.front().unwrap();    // 队首元素
+    print!("\n队首元素 peekFirst = {peek_first}");
+    let peek_last = deque.back().unwrap();      // 队尾元素
+    print!("\n队尾元素 peekLast = {peek_last}");
+
+    // 元素出队
+    let poll_first = deque.pop_front().unwrap();    // 队首元素出队
+    print!("\n队首出队元素 pollFirst = {poll_first}，队首出队后 deque = ");
+    inc::print_util::print_queue(&deque);
+    let poll_last = deque.pop_back().unwrap();      // 队尾元素出队     
+    print!("\n队尾出队元素 pollLast = {poll_last}，队尾出队后 deque = ");
+    inc::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

@@ -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}");
+}

codes/rust/chapter_stack_and_queue/stack.rs

@@ -0,0 +1,38 @@
+/**
+ * File: stack.rs
+ * Created Time: 2023-02-05
+ * Author: sjinzh (sjinzh@gmail.com)
+*/
+
+/* Driver Code */
+pub fn main() {
+    // 初始化栈
+    // 在 rust 中，推荐将 Vec 当作栈来使用
+    let mut stack: Vec<i32> = Vec::new();
+
+    // 元素入栈
+    stack.push(1);
+    stack.push(3);
+    stack.push(2);
+    stack.push(5);
+    stack.push(4);
+    print!("栈 stack = ");
+    inc::print_util::print_array(&stack);
+
+    // 访问栈顶元素
+    let peek = stack.get(stack.len() - 1).unwrap();
+    print!("\n栈顶元素 peek = {peek}");
+
+    // 元素出栈
+    let pop = stack.pop().unwrap();
+    print!("\n出栈元素 pop = {pop}，出栈后 stack = ");
+    inc::print_util::print_array(&stack);
+
+    // 获取栈的长度
+    let size = stack.len();
+    print!("\n栈的长度 size = {size}");
+
+    // 判断栈是否为空
+    let is_empty = stack.is_empty();
+    print!("\n栈是否为空 = {is_empty}");
+}