algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 0102.二叉树的层序遍历.md about using vecdeque rust

Browse Source
This commit is contained in:
fw_qaq
2022-11-08 01:29:42 +08:00
committed by GitHub
parent 4df81ae0bb
commit 3f70c16fa6
1 changed files with 24 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
problems/0102.二叉树的层序遍历.md
View File

@ -380,29 +380,32 @@ object Solution {
Rust: Rust:
```rust ```rust
pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> { use std::cell::RefCell;
let mut ans = Vec::new(); use std::rc::Rc;
let mut stack = Vec::new(); use std::collections::VecDeque;
if root.is_none(){ impl Solution {
return ans; pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
} let mut res = vec![];
stack.push(root.unwrap()); let mut queue = VecDeque::new();
while stack.is_empty()!= true{ if root.is_some() {
let num = stack.len(); queue.push_back(root);
let mut level = Vec::new();
for _i in 0..num{
let tmp = stack.remove(0);
level.push(tmp.borrow_mut().val);
if tmp.borrow_mut().left.is_some(){
stack.push(tmp.borrow_mut().left.take().unwrap());
}
if tmp.borrow_mut().right.is_some(){
stack.push(tmp.borrow_mut().right.take().unwrap());
}
} }
ans.push(level); while !queue.is_empty() {
let mut temp = vec![];
for _ in 0..queue.len() {
let node = queue.pop_front().unwrap().unwrap();
temp.push(node.borrow().val);
if node.borrow().left.is_some() {
queue.push_back(node.borrow().left.clone());
}
if node.borrow().right.is_some() {
queue.push_back(node.borrow().right.clone());
}
}
res.push(temp);
}
res
} }
ans
} }
``` ```