You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
51 lines
1.1 KiB
51 lines
1.1 KiB
/**
|
|
* File: preorder_traversal_ii_compact.kt
|
|
* Created Time: 2024-01-25
|
|
* Author: curtishd (1023632660@qq.com)
|
|
*/
|
|
|
|
package chapter_backtracking.preorder_traversal_ii_compact
|
|
|
|
import utils.TreeNode
|
|
import utils.printTree
|
|
|
|
var path: MutableList<TreeNode>? = null
|
|
var res: MutableList<MutableList<TreeNode>>? = null
|
|
|
|
/* 前序遍历：例题二 */
|
|
fun preOrder(root: TreeNode?) {
|
|
if (root == null) {
|
|
return
|
|
}
|
|
// 尝试
|
|
path!!.add(root)
|
|
if (root._val == 7) {
|
|
// 记录解
|
|
res!!.add(path!!.toMutableList())
|
|
}
|
|
preOrder(root.left)
|
|
preOrder(root.right)
|
|
// 回退
|
|
path!!.removeAt(path!!.size - 1)
|
|
}
|
|
|
|
/* Driver Code */
|
|
fun main() {
|
|
val root = TreeNode.listToTree(mutableListOf(1, 7, 3, 4, 5, 6, 7))
|
|
println("\n初始化二叉树")
|
|
printTree(root)
|
|
|
|
// 前序遍历
|
|
path = mutableListOf()
|
|
res = mutableListOf()
|
|
preOrder(root)
|
|
|
|
println("\n输出所有根节点到节点 7 的路径")
|
|
for (path in res!!) {
|
|
val _vals = mutableListOf<Int>()
|
|
for (node in path) {
|
|
_vals.add(node._val)
|
|
}
|
|
println(_vals)
|
|
}
|
|
} |