learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

优化0106.从中序与后序遍历序列构造二叉树.mdJava解法

This commit is contained in:
ironartisan 2021-09-06 11:32:18 +08:00
parent cae6b56b2d
commit 3450a85b6d
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
problems/0106.从中序与后序遍历序列构造二叉树.md
View File

@ -607,6 +607,7 @@ class Solution {
for (int i = inLeft; i < inRight; i++) { for (int i = inLeft; i < inRight; i++) {
if (inorder[i] == rootVal) { if (inorder[i] == rootVal) {
rootIndex = i; rootIndex = i;
break;
} }
} }
// 根据rootIndex划分左右子树 // 根据rootIndex划分左右子树