auto commit

notes/剑指 offer 题解.md

@@ -254,16 +254,16 @@ public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
 public TreeNode reConstructBinaryTree(int[] pre, int[] in) {
     return reConstructBinaryTree(pre, 0, pre.length - 1, in, 0, in.length - 1);
 }
+
 private TreeNode reConstructBinaryTree(int[] pre, int preL, int preR, int[] in, int inL, int inR) {
-    if(preL > preR || inL > inR) return null;
+    if (preL == preR) return new TreeNode(pre[preL]);
+    if (preL > preR || inL > inR) return null;
     TreeNode root = new TreeNode(pre[preL]);
-    if (preL != preR) {
+    int midIdx = inL;
-        int idx = inL;
+    while (midIdx <= inR && in[midIdx] != root.val) midIdx++;
-        while (idx <= inR && in[idx] != root.val) idx++;
+    int leftTreeSize = midIdx - inL;
-        int leftTreeLen = idx - inL;
+    root.left = reConstructBinaryTree(pre, preL + 1, preL + leftTreeSize, in, inL, inL + leftTreeSize - 1);
-        root.left = reConstructBinaryTree(pre, preL + 1, preL + leftTreeLen, in, inL, inL + leftTreeLen - 1);
+    root.right = reConstructBinaryTree(pre, preL + leftTreeSize + 1, preR, in, inL + leftTreeSize + 1, inR);
-        root.right = reConstructBinaryTree(pre, preL + leftTreeLen + 1, preR, in, inL + leftTreeLen + 1, inR);
-    }
     return root;
 }
 ```
@@ -274,6 +274,13 @@ private TreeNode reConstructBinaryTree(int[] pre, int preL, int preR, int[] in,
 
 <EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>㣬<EFBFBD><EFBFBD><EFBFBD>ҳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>㲢<EFBFBD>ҷ<EFBFBD><EFBFBD>ء<EFBFBD>ע<EFBFBD>⣬<EFBFBD><EFBFBD><EFBFBD>еĽ<EFBFBD><EFBFBD>㲻<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӽ<EFBFBD><EFBFBD>㣬ͬʱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD>򸸽<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD>롣
 
+**<EFBFBD><EFBFBD><EFBFBD><EFBFBD>˼·**
+
+- <20><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ڵ<EFBFBD><DAB5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD>գ<EFBFBD><D5A3><EFBFBD>ô<EFBFBD>ýڵ<C3BD><DAB5><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ڵ<EFBFBD><DAB5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ㣻
+- <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ҵ<EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ýڵ<C3BD><DAB5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƚڵ㡣
+
+![](https://github.com/CyC2018/InterviewNotes/blob/master/pics/6fec7f56-a685-4232-b03e-c92a8dfba486.png)
+
 ```java
 public TreeLinkNode GetNext(TreeLinkNode pNode) {
     if (pNode == null) return null;