algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-07 06:44:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format python codes with black. (#453)

Browse Source
This commit is contained in:
Yudong Jin
2023-04-09 05:05:35 +08:00
committed by GitHub
parent 1c8b7ef559
commit 5ddcb60825
45 changed files with 656 additions and 456 deletions
Download Patch File Download Diff File Expand all files Collapse all files

43
codes/python/modules/print_util.py
View File

@ -7,31 +7,38 @@ Author: Krahets (krahets@163.com), msk397 (machangxinq@gmail.com)
from .binary_tree import TreeNode, list_to_tree
from .linked_list import ListNode, linked_list_to_list
def print_matrix(mat: list[list[int]]) -> None:
""" Print a matrix """
"""Print a matrix"""
s: list[str] = []
for arr in mat:
s.append(' ' + str(arr))
s.append(" " + str(arr))
print("[\n" + ",\n".join(s) + "\n]")
print('[\n' + ',\n'.join(s) + '\n]')
def print_linked_list(head: ListNode | None) -> None:
""" Print a linked list """
"""Print a linked list"""
arr: list[int] = linked_list_to_list(head)
print(' -> '.join([str(a) for a in arr]))
print(" -> ".join([str(a) for a in arr]))
class Trunk:
def __init__(self, prev, string: str | None = None) -> None:
self.prev = prev
self.str = string
def show_trunks(p: Trunk | None) -> None:
if p is None:
return
show_trunks(p.prev)
print(p.str, end='')
print(p.str, end="")
def print_tree(root: TreeNode | None, prev: Trunk | None = None, is_left: bool = False) -> None:
def print_tree(
root: TreeNode | None, prev: Trunk | None = None, is_left: bool = False
) -> None:
"""
Print a binary tree
This tree printer is borrowed from TECHIE DELIGHT
@ -40,33 +47,35 @@ def print_tree(root: TreeNode | None, prev: Trunk | None = None, is_left: bool =
if root is None:
return
prev_str: str = ' '
prev_str: str = " "
trunk = Trunk(prev, prev_str)
print_tree(root.right, trunk, True)
if prev is None:
trunk.str = '———'
trunk.str = "———"
elif is_left:
trunk.str = '/———'
prev_str = ' |'
trunk.str = "/———"
prev_str = " |"
else:
trunk.str = '\———'
trunk.str = "\———"
prev.str = prev_str
show_trunks(trunk)
print(' ' + str(root.val))
print(" " + str(root.val))
if prev:
prev.str = prev_str
trunk.str = ' |'
trunk.str = " |"
print_tree(root.left, trunk, False)
def print_dict(mapp: dict) -> None:
""" Print a dict """
"""Print a dict"""
for key, value in mapp.items():
print(key, '->', value)
print(key, "->", value)
def print_heap(heap: list[int]) -> None:
""" Print a heap both in array and tree representations """
"""Print a heap both in array and tree representations"""
print("堆的数组表示：", heap)
print("堆的树状表示：")
root: TreeNode | None = list_to_tree(heap)