algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Unify the comment style of python codes

Browse Source
This commit is contained in:
krahets
2023-04-09 05:30:02 +08:00
parent 5ddcb60825
commit 10e2180013
53 changed files with 109 additions and 106 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/python/chapter_tree/avl_tree.py
View File

@@ -173,7 +173,7 @@ class AVLTree:
return cur
""" Driver Code """
"""Driver Code"""
if __name__ == "__main__":
def test_insert(tree: AVLTree, val: int):

2
codes/python/chapter_tree/binary_search_tree.py
View File

@@ -136,7 +136,7 @@ class BinarySearchTree:
return root
""" Driver Code """
"""Driver Code"""
if __name__ == "__main__":
# 初始化二叉搜索树
nums = list(range(1, 16)) # [1, 2, ..., 15]

2
codes/python/chapter_tree/binary_tree.py
View File

@@ -10,7 +10,7 @@ sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
""" Driver Code """
"""Driver Code"""
if __name__ == "__main__":
# 初始化二叉树
# 初始化节点

2
codes/python/chapter_tree/binary_tree_bfs.py
View File

@@ -28,7 +28,7 @@ def level_order(root: TreeNode | None) -> list[int]:
return res
""" Driver Code """
"""Driver Code"""
if __name__ == "__main__":
# 初始化二叉树
# 这里借助了一个从数组直接生成二叉树的函数

2
codes/python/chapter_tree/binary_tree_dfs.py
View File

@@ -40,7 +40,7 @@ def post_order(root: TreeNode | None) -> None:
res.append(root.val)
""" Driver Code """
"""Driver Code"""
if __name__ == "__main__":
# 初始化二叉树
# 这里借助了一个从数组直接生成二叉树的函数