From 98a8a8b8b1c8068d1cc291b0770369318d867338 Mon Sep 17 00:00:00 2001
From: Du Zongwei <894588765@qq.com>
Date: Mon, 6 Mar 2023 09:48:49 +0800
Subject: [PATCH] =?UTF-8?q?modified=20ACM=E4=B8=8B=E6=9E=84=E5=BB=BA?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=20Python?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/前序/ACM模式如何构建二叉树.md | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/problems/前序/ACM模式如何构建二叉树.md b/problems/前序/ACM模式如何构建二叉树.md
index 42bf7af0..b6446403 100644
--- a/problems/前序/ACM模式如何构建二叉树.md
+++ b/problems/前序/ACM模式如何构建二叉树.md
@@ -305,11 +305,12 @@ def construct_binary_tree(nums: []) -> TreeNode:
         Tree.append(node)
         if i == 0:
             root = node
+    # 直接判断2*i+2<len(Tree)会漏掉2*i+1=len(Tree)-1的情况
     for i in range(len(Tree)):
-        node = Tree[i]
-        if node and (2 * i + 2) < len(Tree):
-            node.left = Tree[i * 2 + 1]
-            node.right = Tree[i * 2 + 2]
+        if Tree[i] and 2 * i + 1 < len(Tree):
+            Tree[i].left = Tree[2 * i + 1]
+            if 2 * i + 2 < len(Tree):
+                Tree[i].right = Tree[2 * i + 2]
     return root