剑指Offer(牛客网)-重建二叉树

题目来源：

https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目描述：

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。

代码如下：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
        return reConstructBinaryTree(pre,in,0,pre.length-1,0,in.length-1);
    }
    
    private TreeNode reConstructBinaryTree(int [] pre,int [] in,int preStart,int preEnd,int inStart,int inEnd){
        if(preStart==pre.length){
            return null;
        }
        TreeNode root = new TreeNode(pre[preStart]);
        if(preStart==preEnd){
            return root;
        }
        for(int index=inEnd;index>=inStart;index--){
            if(pre[preStart]==in[index]){
                int length = index - inStart;
                root.left = reConstructBinaryTree(pre,in,preStart+1,preStart+length,inStart,index-1);
                root.right = reConstructBinaryTree(pre,in,preStart+length+1,preEnd,index+1,inEnd);
                return root;
            }
        }
        return null;
    }
}