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

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

Browse Source 
* 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>
This commit is contained in:
sjinzh
2023-02-09 00:25:01 +08:00
committed by GitHub
parent 6dc21691ed
commit e65c7bd478
20 changed files with 189 additions and 177 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/rust/chapter_stack_and_queue/queue.rs
View File

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