牛客-重建二叉树

题目描述：

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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.length==0 && in.length==0)
            return null;
        TreeNode root = build(pre,in,0,pre.length-1,0,in.length-1);
        return root;
    }
    public TreeNode build(int[] preorder, int[] inorder,int l1,int h1,int l2,int h2){
        //设置当前根节点
        TreeNode root = new TreeNode(preorder[l1]);
        int i = l2;
        for(i=l2;inorder[i]!=root.val;i++);
        int llen = i-l2;   //计算当前根节点左子树中节点的个数
        int rlen = h2 - i;  //计算当前根节点右子树中节点的个数
        if(llen>0)  
            root.left = build(preorder,inorder,l1+1,l1+llen,l2,l2+llen-1);
        else
            root.left = null;
        if(rlen>0)
            root.right = build(preorder,inorder,h1-rlen+1,h1,h2-rlen+1,h2);
        else
            root.right = null;
        return root;
    }
}