algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

modified ACM下构建二叉树 Python

Browse Source
This commit is contained in:
Du Zongwei
2023-03-06 09:48:49 +08:00
parent 5ec197d1b4
commit 98a8a8b8b1
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/前序/ACM模式如何构建二叉树.md
View File

@ -305,11 +305,12 @@ def construct_binary_tree(nums: []) -> TreeNode:
Tree.append(node) Tree.append(node)
if i == 0: if i == 0:
root = node root = node
# 直接判断2*i+2<len(Tree)会漏掉2*i+1=len(Tree)-1的情况
for i in range(len(Tree)): for i in range(len(Tree)):
node = Tree[i] if Tree[i] and 2 * i + 1 < len(Tree):
if node and (2 * i + 2) < len(Tree): Tree[i].left = Tree[2 * i + 1]
node.left = Tree[i * 2 + 1] if 2 * i + 2 < len(Tree):
node.right = Tree[i * 2 + 2] Tree[i].right = Tree[2 * i + 2]
return root return root