mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 23:16:28 +08:00
2655a2f66a
* Add kotlin code block for chapter_hashing * Add kotlin code block for chapter_heap. * Add kotlin code block for chapter_stack_and_queue and chapter_tree * fix indentation * Update binary_tree.md * style(kotlin): simplify code and improve readability. * simplify kt code for chapter_computational_complexity. * style(kotlin): replace ArrayList with MutableList. * Update subset_sum_i.kt Use kotlin api instead of java. * Update subset_sum_ii.kt use kotlin api instead of java * style(kotlin): replace ArrayList with mutablelist. --------- Co-authored-by: Yudong Jin <krahets@163.com>
43 lines
No EOL
890 B
Kotlin
43 lines
No EOL
890 B
Kotlin
/**
|
|
* File: preorder_traversal_i_compact.kt
|
|
* Created Time: 2024-01-25
|
|
* Author: curtishd (1023632660@qq.com)
|
|
*/
|
|
|
|
package chapter_backtracking.preorder_traversal_i_compact
|
|
|
|
import utils.TreeNode
|
|
import utils.printTree
|
|
|
|
var res: MutableList<TreeNode>? = null
|
|
|
|
/* 前序遍历：例题一 */
|
|
fun preOrder(root: TreeNode?) {
|
|
if (root == null) {
|
|
return
|
|
}
|
|
if (root.value == 7) {
|
|
// 记录解
|
|
res!!.add(root)
|
|
}
|
|
preOrder(root.left)
|
|
preOrder(root.right)
|
|
}
|
|
|
|
/* Driver Code */
|
|
fun main() {
|
|
val root = TreeNode.listToTree(mutableListOf(1, 7, 3, 4, 5, 6, 7))
|
|
println("\n初始化二叉树")
|
|
printTree(root)
|
|
|
|
// 前序遍历
|
|
res = mutableListOf()
|
|
preOrder(root)
|
|
|
|
println("\n输出所有值为 7 的节点")
|
|
val vals = mutableListOf<Int>()
|
|
for (node in res!!) {
|
|
vals.add(node.value)
|
|
}
|
|
println(vals)
|
|
} |