algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update preorder_traversal_iii.

Browse Source
This commit is contained in:
krahets
2023-07-25 16:39:38 +08:00
parent 90af225dae
commit b067016bfa
20 changed files with 48 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
codes/cpp/chapter_backtracking/preorder_traversal_iii_template.cpp
View File

@@ -37,7 +37,6 @@ void backtrack(vector<TreeNode *> &state, vector<TreeNode *> &choices, vector<ve
if (isSolution(state)) {
// 记录解
recordSolution(state, res);
return;
}
// 遍历所有选择
for (TreeNode *choice : choices) {

2
codes/csharp/chapter_backtracking/preorder_traversal_iii_compact.cs
View File

@@ -41,7 +41,7 @@ public class preorder_traversal_iii_compact {
res = new List<List<TreeNode>>();
preOrder(root);
Console.WriteLine("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点");
Console.WriteLine("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点");
foreach (List<TreeNode> path in res) {
PrintUtil.PrintList(path.Select(p => p.val).ToList());
}

1
codes/csharp/chapter_backtracking/preorder_traversal_iii_template.cs
View File

@@ -38,7 +38,6 @@ public class preorder_traversal_iii_template {
if (isSolution(state)) {
// 记录解
recordSolution(state, res);
return;
}
// 遍历所有选择
foreach (TreeNode choice in choices) {

4
codes/go/chapter_backtracking/preorder_traversal_test.go
View File

@@ -59,7 +59,7 @@ func TestPreorderTraversalIIICompact(t *testing.T) {
res := make([][]*TreeNode, 0)
preOrderIII(root, &res, &path)
fmt.Println("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点")
fmt.Println("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点")
for _, path := range res {
for _, node := range path {
fmt.Printf("%v ", node.Val)
@@ -81,7 +81,7 @@ func TestPreorderTraversalIIITemplate(t *testing.T) {
choices = append(choices, root)
backtrackIII(&state, &choices, &res)
fmt.Println("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点")
fmt.Println("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点")
for _, path := range res {
for _, node := range path {
fmt.Printf("%v ", node.Val)

2
codes/java/chapter_backtracking/preorder_traversal_iii_compact.java
View File

@@ -43,7 +43,7 @@ public class preorder_traversal_iii_compact {
res = new ArrayList<>();
preOrder(root);
System.out.println("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点");
System.out.println("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点");
for (List<TreeNode> path : res) {
List<Integer> vals = new ArrayList<>();
for (TreeNode node : path) {

1
codes/java/chapter_backtracking/preorder_traversal_iii_template.java
View File

@@ -41,7 +41,6 @@ public class preorder_traversal_iii_template {
if (isSolution(state)) {
// 记录解
recordSolution(state, res);
return;
}
// 遍历所有选择
for (TreeNode choice : choices) {

2
codes/javascript/chapter_backtracking/preorder_traversal_iii_compact.js
View File

@@ -37,7 +37,7 @@ const path = [];
const res = [];
preOrder(root, path, res);
console.log('\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点');
console.log('\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点');
res.forEach((path) => {
console.log(path.map((node) => node.val));
});

1
codes/javascript/chapter_backtracking/preorder_traversal_iii_template.js
View File

@@ -38,7 +38,6 @@ function backtrack(state, choices, res) {
if (isSolution(state)) {
// 记录解
recordSolution(state, res);
return;
}
// 遍历所有选择
for (const choice of choices) {

2
codes/python/chapter_backtracking/preorder_traversal_iii_compact.py
View File

@@ -39,6 +39,6 @@ if __name__ == "__main__":
res = list[list[TreeNode]]()
pre_order(root)
print("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点")
print("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点")
for path in res:
print([node.val for node in path])

1
codes/python/chapter_backtracking/preorder_traversal_iii_template.py
View File

@@ -43,7 +43,6 @@ def backtrack(
if is_solution(state):
# 记录解
record_solution(state, res)
return
# 遍历所有选择
for choice in choices:
# 剪枝：检查选择是否合法

2
codes/python/modules/__init__.py
View File

@@ -9,7 +9,7 @@ from .list_node import (
linked_list_to_list,
get_list_node,
)
from .tree_node import TreeNode, list_to_tree, tree_to_list, get_tree_node
from .tree_node import TreeNode, list_to_tree, tree_to_list
from .vertex import Vertex, vals_to_vets, vets_to_vals
from .print_util import (
print_matrix,

11
codes/python/modules/tree_node.py
View File

@@ -67,14 +67,3 @@ def tree_to_list(root: TreeNode | None) -> list[int]:
res = []
tree_to_list_dfs(root, 0, res)
return res
def get_tree_node(root: TreeNode | None, val: int) -> TreeNode | None:
"""Get a tree node with specific value in a binary tree"""
if not root:
return
if root.val == val:
return root
left: TreeNode | None = get_tree_node(root.left, val)
right: TreeNode | None = get_tree_node(root.right, val)
return left if left else right

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

@@ -42,7 +42,7 @@ pub fn main() {
let mut res = Vec::new();
pre_order(&mut res, &mut path, root);
println!("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点");
println!("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点");
for path in res {
let mut vals = Vec::new();
for node in path {

1
codes/rust/chapter_backtracking/preorder_traversal_iii_template.rs
View File

@@ -40,7 +40,6 @@ fn backtrack(state: &mut Vec<Rc<RefCell<TreeNode>>>, choices: &mut Vec<Rc<RefCel
if is_solution(state) {
// 记录解
record_solution(state, res);
return;
}
// 遍历所有选择
for choice in choices {

2
codes/swift/chapter_backtracking/preorder_traversal_iii_compact.swift
View File

@@ -42,7 +42,7 @@ enum PreorderTraversalIIICompact {
res = []
preOrder(root: root)
print("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点")
print("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点")
for path in res {
var vals: [Int] = []
for node in path {

3
codes/swift/chapter_backtracking/preorder_traversal_iii_template.swift
View File

@@ -36,7 +36,6 @@ func backtrack(state: inout [TreeNode], choices: [TreeNode], res: inout [[TreeNo
// 检查是否为解
if isSolution(state: state) {
recordSolution(state: state, res: &res)
return
}
// 遍历所有选择
for choice in choices {
@@ -65,7 +64,7 @@ enum PreorderTraversalIIITemplate {
var res: [[TreeNode]] = []
backtrack(state: &state, choices: [root].compactMap { $0 }, res: &res)
print("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点")
print("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点")
for path in res {
var vals: [Int] = []
for node in path {

2
codes/typescript/chapter_backtracking/preorder_traversal_iii_compact.ts
View File

@@ -42,7 +42,7 @@ const path: TreeNode[] = [];
const res: TreeNode[][] = [];
preOrder(root, path, res);
console.log('\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点');
console.log('\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点');
res.forEach((path) => {
console.log(path.map((node) => node.val));
});

1
codes/typescript/chapter_backtracking/preorder_traversal_iii_template.ts
View File

@@ -43,7 +43,6 @@ function backtrack(
if (isSolution(state)) {
// 记录解
recordSolution(state, res);
return;
}
// 遍历所有选择
for (const choice of choices) {