完结君
完结君
全部文章
分类
题解(2)
归档
标签
去牛客网
登录
/
注册
完结君的博客
全部文章
(共2篇)
题解 | #实现二叉树先序,中序和后序遍历#hash表+递归
tree_candidates = dict() Node_num, root_val = map(int, input().split()) for _ in range(Node_num): root, left, right = map(int, input().split()) ...
Python3
哈希表
2022-05-11
0
269
题解 | #迷宫问题#回溯遍历
y_size, x_size = [int(x) for x in input().split()] board = [] while True: try: line = [int(x) for x in input().split()] board.appe...
Python3
回溯
2022-05-10
0
278