algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-03 05:27:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace poll with pop in Queue and Deque (#415)

Browse Source
This commit is contained in:
Yudong Jin
2023-03-13 21:58:21 +08:00
committed by GitHub
parent 2d17ee8e92
commit 8aebbaad21
77 changed files with 261 additions and 261 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -27,11 +27,11 @@ pub fn main() {
print!("\n队尾元素 peekLast = {peek_last}");
// 元素出队
let poll_first = deque.pop_front().unwrap(); // 队首元素出队
print!("\n队首出队元素 pollFirst = {poll_first}，队首出队后 deque = ");
let pop_first = deque.pop_front().unwrap(); // 队首元素出队
print!("\n队首出队元素 popFirst = {pop_first}，队首出队后 deque = ");
print_util::print_queue(&deque);
let poll_last = deque.pop_back().unwrap(); // 队尾元素出队
print!("\n队尾出队元素 pollLast = {poll_last}，队尾出队后 deque = ");
let pop_last = deque.pop_back().unwrap(); // 队尾元素出队
print!("\n队尾出队元素 popLast = {pop_last}，队尾出队后 deque = ");
print_util::print_queue(&deque);
// 获取双向队列的长度