algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +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/java/chapter_backtracking/preorder_traversal_iii_compact.java
View File

@ -24,6 +24,7 @@ public class preorder_traversal_iii_compact {
if (root.val == 7) {
// 记录解
res.add(new ArrayList<>(path));
path.remove(path.size() - 1);
return;
}
preOrder(root.left);
@ -42,7 +43,7 @@ public class preorder_traversal_iii_compact {
res = new ArrayList<>();
preOrder(root);
System.out.println("\n输出所有根节点到节点 7 的路径，且路径中不包含值为 3 的节点");
System.out.println("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点");
for (List<TreeNode> path : res) {
List<Integer> vals = new ArrayList<>();
for (TreeNode node : path) {