leetcode construct-binary-tree-from-preorder-and-inorder-traversal给树的先序跟中序，求树

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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; }
 * }
 */
import java.util.*;
public class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        
        if(preorder.length==0&&inorder.length==0) return null;
        
        TreeNode root = new TreeNode(preorder[0]);
        
        int len = inorder.length;
        int lenleft = 0;
        for(int i =0;i<len;i++){
            if(inorder[i]==preorder[0]){
                lenleft = i;//左节点长度
                break;
            }
        }
        
        root.left = buildTree(Arrays.copyOfRange(preorder,1,lenleft+1),Arrays.copyOfRange(inorder,0,lenleft));
        root.right = buildTree(Arrays.copyOfRange(preorder,lenleft+1,len),Arrays.copyOfRange(inorder,lenleft+1,len));
        return root;
    }
}

/**
 * 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){//当前结点的左右子树为null
            return null;
        }
        
        TreeNode root = new TreeNode(pre[0]);
      
            
        for(int i=0;i<in.length;i++){
            if(pre[0]==in[i]){
                node.left = reConstructBinaryTree(Arrays.copyOfRange(pre,1,i+1),Arrays.copyOfRange(in,0,i));
                node.right = reConstructBinaryTree(Arrays.copyOfRange(pre,i+2,pre.length),Arrays.copyOfRange(in,i+2,in.length));
            }
            
        }
        
        
        
        return root;
    }
}