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划分左右子树