剑指 Offer 07. 重建二叉树

用分治法，先序遍历的第一个节点就是根。在中序遍历中通过根 区分哪些是左子树的，哪些是右子树的。然后再递归左右子树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int [] preorder;
    Map<Integer,Integer> table=new HashMap<>();
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        this.preorder=preorder;
        for(int i=0;i<inorder.length;i++){
            table.put(inorder[i],i);
        }
       return recur(0,0,inorder.length-1);
    }

    public TreeNode recur(int root,int left,int right){
       if(left>right) return null;
       int i= table.get(preorder[root]);
       TreeNode node=new TreeNode(preorder[root]);
       node.left= recur(root+1,left,i-1);
       node.right=recur(i-left+root+1,i+1,right);
       return node;
    }
}