mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 03:56:28 +08:00
e65c7bd478
* 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>
40 lines
No EOL
952 B
Rust
40 lines
No EOL
952 B
Rust
/*
|
|
* File: stack.rs
|
|
* Created Time: 2023-02-05
|
|
* Author: sjinzh (sjinzh@gmail.com)
|
|
*/
|
|
|
|
include!("../include/include.rs");
|
|
|
|
/* 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.get(stack.len() - 1).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}");
|
|
} |