让我们来写个算法吧，（6）重建二叉树

public class Solution {
    

    public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
       
        return create(pre,0,pre.length-1,in,0,in.length-1);
        
    }
    
    private TreeNode create(int[] pre, int startPre, int endPre, int[] in, int startIn, int endIn) {
        // TODO Auto-generated method stub
        if(startPre>endPre||startIn>endIn)
        {
            return null;
        }
        TreeNode root=new TreeNode(pre[startPre]);
        for(int i=startIn;i<=endIn;i++)
        {
            if(pre[startPre]==in[i])
            {
                
                root.left=create(pre,startPre+1,startPre+i-startIn,in,startIn,i-1);
                root.right=create(pre,startPre+i-startIn+1,endPre,in,i+1,endIn);
                break;
            }
            
            
        }
        
        return root;
        
    }