From 3450a85b6d1318ea5288dccd8475e57069c5a2aa Mon Sep 17 00:00:00 2001
From: ironartisan <54694467+ironartisan@users.noreply.github.com>
Date: Mon, 6 Sep 2021 11:32:18 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BC=98=E5=8C=960106.=E4=BB=8E=E4=B8=AD?=
 =?UTF-8?q?=E5=BA=8F=E4=B8=8E=E5=90=8E=E5=BA=8F=E9=81=8D=E5=8E=86=E5=BA=8F?=
 =?UTF-8?q?=E5=88=97=E6=9E=84=E9=80=A0=E4=BA=8C=E5=8F=89=E6=A0=91.mdJava?=
 =?UTF-8?q?=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0106.从中序与后序遍历序列构造二叉树.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/problems/0106.从中序与后序遍历序列构造二叉树.md b/problems/0106.从中序与后序遍历序列构造二叉树.md
index 39b55d8c..a9639d8f 100644
--- a/problems/0106.从中序与后序遍历序列构造二叉树.md
+++ b/problems/0106.从中序与后序遍历序列构造二叉树.md
@@ -607,6 +607,7 @@ class Solution {
         for (int i = inLeft; i < inRight; i++) {
             if (inorder[i] == rootVal) {
                 rootIndex = i;
+                break;
             }
         }
         // 根据rootIndex划分左右子树