剑指针offer重建二叉树-java

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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) {
        if (pre == null || in == null || pre.length != in.length) {
            return null;
        }
        return reConstructTree(pre, 0, pre.length - 1, in, 0, in.length - 1);
    }
     
    public TreeNode reConstructTree(int [] pre, int preStart, int preEnd, int [] in, int inStart, int inEnd) {
        //递归结束点
        if(preStart > preEnd || inStart > inEnd) {
            return null;
        }
        //构建树根
        TreeNode root = new TreeNode(pre[preStart]);
        for (int i = inStart; i <= inEnd; i++) {
            //找到中序数组里的根
            if (in[i] == pre[preStart]) {
                //新的左子树长度
                int leftLength = i - inStart;
                //构建左子树
                root.left = reConstructTree(pre, preStart + 1, preStart + leftLength, in, inStart, i - 1);
                //构建右子树
                root.right = reConstructTree(pre,  preStart + leftLength + 1, preEnd, in, i + 1, inEnd);
            }
        }
        return root;
         
    }
}