CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 02:10:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: check the rust codes and fix them (#653)

Browse Source 
* fix: check the rust codes and fix it

* Update binary_tree_bfs.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Night Cruising
2023-07-24 22:27:26 +08:00
committed by GitHub
parent 978d3c2ed7
commit fdbe275fc9
18 changed files with 167 additions and 102 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
codes/rust/chapter_stack_and_queue/deque.rs
View File

@@ -12,26 +12,32 @@ use std::collections::VecDeque;
pub fn main() {
// 初始化双向队列
let mut deque: VecDeque<i32> = VecDeque::new();
deque.push_back(2); // 添加至队尾
deque.push_back(3);
deque.push_back(2);
deque.push_back(5);
deque.push_back(4);
deque.push_front(3); // 添加至队首
deque.push_front(1);
print!("双向队列 deque = ");
print_util::print_queue(&deque);
// 访问元素
let peek_first = deque.front().unwrap(); // 队首元素
let peek_first = deque.front().unwrap();
print!("\n队首元素 peekFirst = {peek_first}");
let peek_last = deque.back().unwrap(); // 队尾元素
let peek_last = deque.back().unwrap();
print!("\n队尾元素 peekLast = {peek_last}");
// 元素出队
let pop_first = deque.pop_front().unwrap(); // 队首元素出队
print!("\n队首出队元素 popFirst = {pop_first}，队首出队后 deque = ");
/* 元素入队 */
deque.push_back(4);
print!("\n元素 4 队尾入队后 deque = ");
print_util::print_queue(&deque);
let pop_last = deque.pop_back().unwrap(); // 队尾元素出队
print!("\n队尾出队元素 popLast = {pop_last}，队尾出队后 deque = ");
deque.push_front(1);
print!("\n元素 1 队首入队后 deque = ");
print_util::print_queue(&deque);
// 元素出队
let pop_last = deque.pop_back().unwrap();
print!("\n队尾出队元素 = {pop_last}，队尾出队后 deque = ");
print_util::print_queue(&deque);
let pop_first = deque.pop_front().unwrap();
print!("\n队首出队元素 = {pop_first}，队首出队后 deque = ");
print_util::print_queue(&deque);
// 获取双向队列的长度