hello-algo/zh-hant/codes/rust/chapter_stack_and_queue/stack.rs
Yudong Jin 2a9db6d039
Bug fixes and improvements (#1572)
* Sync zh and zh-hant versions.

* Remove the polyfill.io link from mkdocs.yml

* Update contributors' info for code reviewers and en/zh-hant versions reviewers.

* Fix graph.md

* Update avatars for English version reviewers.

* Sync zh and zh-hant versions.

* Fix two_sum_brute_force.png

* Sync zh and zh-hant versions.
Optimize structrue of index.html.

* Format index.html
2024-11-25 19:21:11 +08:00

40 lines
994 B
Rust

/*
* File: stack.rs
* Created Time: 2023-02-05
* Author: codingonion (coderonion@gmail.com)
*/
use hello_algo_rust::include::print_util;
/* 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 = ");
print_util::print_array(&stack);
// 訪問堆疊頂元素
let peek = stack.last().unwrap();
print!("\n堆疊頂元素 peek = {peek}");
// 元素出堆疊
let pop = stack.pop().unwrap();
print!("\n出堆疊元素 pop = {pop},出堆疊後 stack = ");
print_util::print_array(&stack);
// 獲取堆疊的長度
let size = stack.len();
print!("\n堆疊的長度 size = {size}");
// 判斷堆疊是否為空
let is_empty = stack.is_empty();
print!("\n堆疊是否為空 = {is_empty}");
}