mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 04:06: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>
36 lines
No EOL
888 B
Rust
36 lines
No EOL
888 B
Rust
/*
|
|
* File: print_util.rs
|
|
* Created Time: 2023-02-05
|
|
* Author: sjinzh (sjinzh@gmail.com)
|
|
*/
|
|
|
|
use std::fmt::Display;
|
|
use std::collections::{HashMap, LinkedList};
|
|
|
|
/* Print an array */
|
|
pub fn print_array<T: Display>(nums: &[T]) {
|
|
print!("[");
|
|
if nums.len() > 0 {
|
|
for (i, num) in nums.iter().enumerate() {
|
|
print!("{}{}", num, if i == nums.len() - 1 {"]"} else {", "} );
|
|
}
|
|
} else {
|
|
print!("]");
|
|
}
|
|
}
|
|
|
|
/* Print a hash map */
|
|
pub fn print_hash_map<TKey: Display, TValue: Display>(map: &HashMap<TKey, TValue>) {
|
|
for (key, value) in map {
|
|
println!("{key} -> {value}");
|
|
}
|
|
}
|
|
|
|
/* Print a queue or deque */
|
|
pub fn print_queue<T: Display>(queue: &LinkedList<T>) {
|
|
print!("[");
|
|
let iter = queue.iter();
|
|
for (i, data) in iter.enumerate() {
|
|
print!("{}{}", data, if i == queue.len() - 1 {"]"} else {", "} );
|
|
}
|
|
} |