xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 14:36:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix Python code.

Browse source
This commit is contained in:
krahets 2023-10-14 22:15:02 +08:00
parent 2976d9ff56
commit ada37fd1f8
2 changed files with 9 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
codes/python/chapter_array_and_linkedlist/my_list.py
View file

@ -1,5 +1,5 @@
""" """
File: nums.py File: my_list.py
Created Time: 2022-11-25 Created Time: 2022-11-25
Author: Krahets (krahets@163.com) Author: Krahets (krahets@163.com)
""" """
@ -93,9 +93,7 @@ if __name__ == "__main__":
nums.add(2) nums.add(2)
nums.add(5) nums.add(5)
nums.add(4) nums.add(4)
print( print(f"列表 nums = {nums.to_array()} ，容量 = {nums.capacity()} ，长度 = {nums.size()}")
f"列表 nums = {nums.to_array()} ，容量 = {nums.capacity()} ，长度 = {nums.size()}"
)
# 中间插入元素 # 中间插入元素
nums.insert(6, index=3) nums.insert(6, index=3)
@ -117,6 +115,4 @@ if __name__ == "__main__":
for i in range(10): for i in range(10):
# 在 i = 5 时，列表长度将超出列表容量，此时触发扩容机制 # 在 i = 5 时，列表长度将超出列表容量，此时触发扩容机制
nums.add(i) nums.add(i)
print( print(f"扩容后的列表 {nums.to_array()} ，容量 = {nums.capacity()} ，长度 = {nums.size()}")
f"扩容后的列表 {nums.to_array()} ，容量 = {nums.capacity()} ，长度 = {nums.size()}"
)

12
docs/chapter_tree/avl_tree.md
View file

@ -216,7 +216,7 @@ AVL 树既是二叉搜索树也是平衡二叉树，同时满足这两类二叉
```python title="avl_tree.py" ```python title="avl_tree.py"
[class]{AVLTree}-[func]{height} [class]{AVLTree}-[func]{height}
[class]{AVLTree}-[func]{__update_height} [class]{AVLTree}-[func]{update_height}
``` ```
=== "C++" === "C++"
@ -418,7 +418,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "Python" === "Python"
```python title="avl_tree.py" ```python title="avl_tree.py"
[class]{AVLTree}-[func]{__right_rotate} [class]{AVLTree}-[func]{right_rotate}
``` ```
=== "C++" === "C++"
@ -502,7 +502,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "Python" === "Python"
```python title="avl_tree.py" ```python title="avl_tree.py"
[class]{AVLTree}-[func]{__left_rotate} [class]{AVLTree}-[func]{left_rotate}
``` ```
=== "C++" === "C++"
@ -605,7 +605,7 @@ AVL 树的特点在于“旋转”操作，它能够在不影响二叉树的中
=== "Python" === "Python"
```python title="avl_tree.py" ```python title="avl_tree.py"
[class]{AVLTree}-[func]{__rotate} [class]{AVLTree}-[func]{rotate}
``` ```
=== "C++" === "C++"
@ -685,7 +685,7 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
```python title="avl_tree.py" ```python title="avl_tree.py"
[class]{AVLTree}-[func]{insert} [class]{AVLTree}-[func]{insert}
[class]{AVLTree}-[func]{__insert_helper} [class]{AVLTree}-[func]{insert_helper}
``` ```
=== "C++" === "C++"
@ -785,7 +785,7 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
```python title="avl_tree.py" ```python title="avl_tree.py"
[class]{AVLTree}-[func]{remove} [class]{AVLTree}-[func]{remove}
[class]{AVLTree}-[func]{__remove_helper} [class]{AVLTree}-[func]{remove_helper}
``` ```
=== "C++" === "C++"