CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2024-01-07 03:26:23 +08:00
parent 6f96660753
commit 40c68a0d2a
24 changed files with 497 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
docs/chapter_tree/array_representation_of_tree.md
View File

@@ -154,7 +154,7 @@ comments: true
self._tree = list(arr)
def size(self):
"""节点数量"""
"""数组长度"""
return len(self._tree)
def val(self, i: int) -> int:
@@ -231,7 +231,7 @@ comments: true
tree = arr;
}
/* 节点数量 */
/* 数组长度 */
int size() {
return tree.size();
}
@@ -326,7 +326,7 @@ comments: true
tree = new ArrayList<>(arr);
}
/* 节点数量 */
/* 数组长度 */
public int size() {
return tree.size();
}
@@ -413,7 +413,7 @@ comments: true
class ArrayBinaryTree(List<int?> arr) {
List<int?> tree = new(arr);
/* 节点数量 */
/* 数组长度 */
public int Size() {
return tree.Count;
}
@@ -508,7 +508,7 @@ comments: true
}
}
/* 节点数量 */
/* 数组长度 */
func (abt *arrayBinaryTree) size() int {
return len(abt.tree)
}
@@ -605,7 +605,7 @@ comments: true
tree = arr
}
/* 节点数量 */
/* 数组长度 */
func size() -> Int {
tree.count
}
@@ -703,7 +703,7 @@ comments: true
this.#tree = arr;
}
/* 节点数量 */
/* 数组长度 */
size() {
return this.#tree.length;
}
@@ -789,7 +789,7 @@ comments: true
this.#tree = arr;
}
/* 节点数量 */
/* 数组长度 */
size(): number {
return this.#tree.length;
}
@@ -873,7 +873,7 @@ comments: true
/* 构造方法 */
ArrayBinaryTree(this._tree);
/* 节点数量 */
/* 数组长度 */
int size() {
return _tree.length;
}
@@ -972,7 +972,7 @@ comments: true
Self { tree: arr }
}
/* 节点数量 */
/* 数组长度 */
fn size(&self) -> i32 {
self.tree.len() as i32
}
@@ -1083,7 +1083,7 @@ comments: true
free(abt);
}
/* 节点数量 */
/* 数组长度 */
int size(ArrayBinaryTree *abt) {
return abt->size;
}