algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-03 05:27:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix the code of preorder_traversal_iii_compact

Browse Source
This commit is contained in:
krahets
2023-07-21 22:08:26 +08:00
parent 075c3abf88
commit bba62bbe75
11 changed files with 19 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
codes/rust/chapter_backtracking/preorder_traversal_iii_compact.rs
View File

@ -21,6 +21,7 @@ fn pre_order(res: &mut Vec<Vec<Rc<RefCell<TreeNode>>>>, path: &mut Vec<Rc<RefCel
if node.borrow().val == 7 {
// 记录解
res.push(path.clone());
path.remove(path.len() - 1);
return;
}
pre_order(res, path, node.borrow().left.clone());
@ -41,7 +42,7 @@ pub fn main() {
let mut res = Vec::new();
pre_order(&mut res, &mut path, root);
println!("\n输出所有根节点到节点 7 的路径，且路径中不包含值为 3 的节点");
println!("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点");
for path in res {
let mut vals = Vec::new();
for node in path {