You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
82 lines
1.8 KiB
82 lines
1.8 KiB
"""
|
|
File: print_util.py
|
|
Created Time: 2021-12-11
|
|
Author: krahets (krahets@163.com), msk397 (machangxinq@gmail.com)
|
|
"""
|
|
|
|
from .tree_node import TreeNode, list_to_tree
|
|
from .list_node import ListNode, linked_list_to_list
|
|
|
|
|
|
def print_matrix(mat: list[list[int]]):
|
|
"""打印矩阵"""
|
|
s = []
|
|
for arr in mat:
|
|
s.append(" " + str(arr))
|
|
print("[\n" + ",\n".join(s) + "\n]")
|
|
|
|
|
|
def print_linked_list(head: ListNode | None):
|
|
"""打印链表"""
|
|
arr: list[int] = linked_list_to_list(head)
|
|
print(" -> ".join([str(a) for a in arr]))
|
|
|
|
|
|
class Trunk:
|
|
def __init__(self, prev, string: str | None = None):
|
|
self.prev = prev
|
|
self.str = string
|
|
|
|
|
|
def show_trunks(p: Trunk | None):
|
|
if p is None:
|
|
return
|
|
show_trunks(p.prev)
|
|
print(p.str, end="")
|
|
|
|
|
|
def print_tree(
|
|
root: TreeNode | None, prev: Trunk | None = None, is_right: bool = False
|
|
):
|
|
"""
|
|
打印二叉树
|
|
This tree printer is borrowed from TECHIE DELIGHT
|
|
https://www.techiedelight.com/c-program-print-binary-tree/
|
|
"""
|
|
if root is None:
|
|
return
|
|
|
|
prev_str = " "
|
|
trunk = Trunk(prev, prev_str)
|
|
print_tree(root.right, trunk, True)
|
|
|
|
if prev is None:
|
|
trunk.str = "———"
|
|
elif is_right:
|
|
trunk.str = "/———"
|
|
prev_str = " |"
|
|
else:
|
|
trunk.str = "\———"
|
|
prev.str = prev_str
|
|
|
|
show_trunks(trunk)
|
|
print(" " + str(root.val))
|
|
if prev:
|
|
prev.str = prev_str
|
|
trunk.str = " |"
|
|
print_tree(root.left, trunk, False)
|
|
|
|
|
|
def print_dict(hmap: dict):
|
|
"""打印字典"""
|
|
for key, value in hmap.items():
|
|
print(key, "->", value)
|
|
|
|
|
|
def print_heap(heap: list[int]):
|
|
"""打印堆"""
|
|
print("堆的数组表示：", heap)
|
|
print("堆的树状表示：")
|
|
root: TreeNode | None = list_to_tree(heap)
|
|
print_tree(root)
|