fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

🦄 refactor(rust/deque): change LinkedList to VecDeque (#364)

Browse Source 
* 🦄 refactor(deque):  change LinkedList to VecDeque

* 📃 docs(deque): add author

* 🦄 refactor(rust/queue):  change LinkedList to VecDeque

* 📃 docs(rust/queue): add author

* 📃 docs(deque): corrent author format
This commit is contained in:
xBLACKICEx 2023-02-15 14:32:03 +01:00 committed by GitHub
parent f0b092fec4
commit 1209261bdd
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,17 +1,17 @@
/* /*
* File: deque.rs * File: deque.rs
* Created Time: 2023-02-05 * Created Time: 2023-02-05
* Author: sjinzh (sjinzh@gmail.com) * Author: sjinzh (sjinzh@gmail.com), xBLACKICEx (xBLACKICEx@outlook.com)
*/ */
include!("../include/include.rs"); include!("../include/include.rs");
use std::collections::LinkedList; use std::collections::VecDeque;
/* Driver Code */ /* Driver Code */
pub fn main() { pub fn main() {
// 初始化双向队列 // 初始化双向队列
let mut deque: LinkedList<i32> = LinkedList::new(); let mut deque: VecDeque<i32> = VecDeque::new();
deque.push_back(2); // 添加至队尾 deque.push_back(2); // 添加至队尾
deque.push_back(5); deque.push_back(5);
deque.push_back(4); deque.push_back(4);

6
codes/rust/chapter_stack_and_queue/queue.rs
View File

@ -1,17 +1,17 @@
/* /*
* File: queue.rs * File: queue.rs
* Created Time: 2023-02-05 * Created Time: 2023-02-05
* Author: sjinzh (sjinzh@gmail.com) * Author: sjinzh (sjinzh@gmail.com), xBLACKICEx (xBLACKICEx@outlook.com)
*/ */
include!("../include/include.rs"); include!("../include/include.rs");
use std::collections::LinkedList; use std::collections::VecDeque;
/* Driver Code */ /* Driver Code */
pub fn main() { pub fn main() {
// 初始化队列 // 初始化队列
let mut queue: LinkedList<i32> = LinkedList::new(); let mut queue: VecDeque<i32> = VecDeque::new();
// 元素入队 // 元素入队
queue.push_back(1); queue.push_back(1);

6
codes/rust/include/print_util.rs
View File

@ -1,11 +1,11 @@
/* /*
* File: print_util.rs * File: print_util.rs
* Created Time: 2023-02-05 * Created Time: 2023-02-05
* Author: sjinzh (sjinzh@gmail.com) * Author: sjinzh (sjinzh@gmail.com), xBLACKICEx (xBLACKICEx@outlook.com)
*/ */
use std::fmt::Display; use std::fmt::Display;
use std::collections::{HashMap, LinkedList}; use std::collections::{HashMap, VecDeque};
/* Print an array */ /* Print an array */
pub fn print_array<T: Display>(nums: &[T]) { pub fn print_array<T: Display>(nums: &[T]) {
@ -27,7 +27,7 @@ pub fn print_hash_map<TKey: Display, TValue: Display>(map: &HashMap<TKey, TValue
} }
/* Print a queue or deque */ /* Print a queue or deque */
pub fn print_queue<T: Display>(queue: &LinkedList<T>) { pub fn print_queue<T: Display>(queue: &VecDeque<T>) {
print!("["); print!("[");
let iter = queue.iter(); let iter = queue.iter();
for (i, data) in iter.enumerate() { for (i, data) in iter.enumerate() {