mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-03 02:43:41 +08:00
feat: add Rust code in queue.md and deque.md (#757)
* feat: add Rust code in queue.md * feat: add Rust code in deque.md * style: fix comment style
This commit is contained in:
@@ -301,7 +301,33 @@
|
||||
=== "Rust"
|
||||
|
||||
```rust title="deque.rs"
|
||||
/* 初始化双向队列 */
|
||||
let mut deque: VecDeque<u32> = VecDeque::new();
|
||||
|
||||
/* 元素入队 */
|
||||
deque.push_back(2); // 添加至队尾
|
||||
deque.push_back(5);
|
||||
deque.push_back(4);
|
||||
deque.push_front(3); // 添加至队首
|
||||
deque.push_front(1);
|
||||
|
||||
/* 访问元素 */
|
||||
if let Some(front) = deque.front() { // 队首元素
|
||||
}
|
||||
if let Some(rear) = deque.back() { // 队尾元素
|
||||
}
|
||||
|
||||
/* 元素出队 */
|
||||
if let Some(pop_front) = deque.pop_front() { // 队首元素出队
|
||||
}
|
||||
if let Some(pop_rear) = deque.pop_back() { // 队尾元素出队
|
||||
}
|
||||
|
||||
/* 获取双向队列的长度 */
|
||||
let size = deque.len();
|
||||
|
||||
/* 判断双向队列是否为空 */
|
||||
let is_empty = deque.is_empty();
|
||||
```
|
||||
|
||||
=== "C"
|
||||
|
||||
Reference in New Issue
Block a user