4.重建二叉树

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.HashMap;
import java.util.Map;
public class Solution {
    private Map<Integer,Integer> map;
    public TreeNode reConstructBinaryTree(int [] pre, int [] in) {
        map=new HashMap<Integer,Integer>();
        for(int i=0;i<in.length;i++){
            map.put(in[i],i);
        }
        return RecurConstructTree(pre,0,pre.length-1,0);
    }
    public  TreeNode RecurConstructTree(int[] pre,int preL,int preR,int inL){
        if(preL>preR){
            return null;
        }
        TreeNode root=new TreeNode(pre[preL]);
        int index=map.get(root.val);
        int leftSize=index-inL;
        root.left=RecurConstructTree(pre,preL+1,preL+leftSize,inL);
        root.right=RecurConstructTree(pre,preL+leftSize+1,preR,inL+leftSize+1);
        return root;
    }
}