xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-09-02 21:27:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(Kotlin): Replace value with _val (#1254)

Browse Source 
* ci(kotlin): Add workflow file.

* Update kotlin.yml

* style(kotlin): value -> _val

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
curtishd
2024-04-10 18:09:43 +08:00
committed by GitHub
parent 39e2e1a5c1
commit 1623e3c6a8
28 changed files with 152 additions and 152 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/kotlin/chapter_tree/avl_tree.kt
+27 -27
View File
@@ -93,20 +93,20 @@ class AVLTree {
}
/* 插入节点 */
fun insert(value: Int) {
root = insertHelper(root, value)
fun insert(_val: Int) {
root = insertHelper(root, _val)
}
/* 递归插入节点（辅助方法） */
private fun insertHelper(n: TreeNode?, value: Int): TreeNode {
private fun insertHelper(n: TreeNode?, _val: Int): TreeNode {
if (n == null)
return TreeNode(value)
return TreeNode(_val)
var node = n
/* 1. 查找插入位置并插入节点 */
if (value < node.value)
node.left = insertHelper(node.left, value)
else if (value > node.value)
node.right = insertHelper(node.right, value)
if (_val < node._val)
node.left = insertHelper(node.left, _val)
else if (_val > node._val)
node.right = insertHelper(node.right, _val)
else
return node // 重复节点不插入，直接返回
updateHeight(node) // 更新节点高度
@@ -117,18 +117,18 @@ class AVLTree {
}
/* 删除节点 */
fun remove(value: Int) {
root = removeHelper(root, value)
fun remove(_val: Int) {
root = removeHelper(root, _val)
}
/* 递归删除节点（辅助方法） */
private fun removeHelper(n: TreeNode?, value: Int): TreeNode? {
private fun removeHelper(n: TreeNode?, _val: Int): TreeNode? {
var node = n ?: return null
/* 1. 查找节点并删除 */
if (value < node.value)
node.left = removeHelper(node.left, value)
else if (value > node.value)
node.right = removeHelper(node.right, value)
if (_val < node._val)
node.left = removeHelper(node.left, _val)
else if (_val > node._val)
node.right = removeHelper(node.right, _val)
else {
if (node.left == null || node.right == null) {
val child = if (node.left != null)
@@ -147,8 +147,8 @@ class AVLTree {
while (temp!!.left != null) {
temp = temp.left
}
node.right = removeHelper(node.right, temp.value)
node.value = temp.value
node.right = removeHelper(node.right, temp._val)
node._val = temp._val
}
}
updateHeight(node) // 更新节点高度
@@ -159,15 +159,15 @@ class AVLTree {
}
/* 查找节点 */
fun search(value: Int): TreeNode? {
fun search(_val: Int): TreeNode? {
var cur = root
// 循环查找，越过叶节点后跳出
while (cur != null) {
// 目标节点在 cur 的右子树中
cur = if (cur.value < value)
cur = if (cur._val < _val)
cur.right!!
// 目标节点在 cur 的左子树中
else if (cur.value > value)
else if (cur._val > _val)
cur.left
// 找到目标节点，跳出循环
else
@@ -178,15 +178,15 @@ class AVLTree {
}
}
fun testInsert(tree: AVLTree, value: Int) {
tree.insert(value)
println("\n插入节点 $value 后，AVL 树为")
fun testInsert(tree: AVLTree, _val: Int) {
tree.insert(_val)
println("\n插入节点 $_val 后，AVL 树为")
printTree(tree.root)
}
fun testRemove(tree: AVLTree, value: Int) {
tree.remove(value)
println("\n删除节点 $value 后，AVL 树为")
fun testRemove(tree: AVLTree, _val: Int) {
tree.remove(_val)
println("\n删除节点 $_val 后，AVL 树为")
printTree(tree.root)
}
@@ -219,5 +219,5 @@ fun main() {
/* 查询节点 */
val node = avlTree.search(7)
println("\n 查找到的节点对象为 $node，节点值 = ${node?.value}")
println("\n 查找到的节点对象为 $node，节点值 = ${node?._val}")
}