剑指 Offer 07. 重建二叉树

题目

输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。

例如，给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树：

    3
   / \
  9  20
    /  \
   15   7

解答

/**
 * 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> map = new HashMap<>();
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        //方法一
        // int n = preorder.length;
        // if(n == 0){
        //     return null;
        // }     
        // int val = preorder[0];
        // int index = 0;
        // for(int i = 0; i < n; i++){
        //     if(inorder[i] == val){
        //         index = i;
        //         break;
        //     }
        // }
        // TreeNode root = new TreeNode(val);
        // root.left = buildTree(Arrays.copyOfRange(preorder, 1, 1 + index), Arrays.copyOfRange(inorder, 0, index));
        // root.right = buildTree(Arrays.copyOfRange(preorder, 1+index, n), Arrays.copyOfRange(inorder, index + 1, n));
        // return root;

        this.preorder = preorder;
        for(int i = 0; i < inorder.length; i++){
            map.put(inorder[i], i);
        }
        return builder(0, 0, inorder.length-1);
    }

    public TreeNode builder(int root, int left, int right){
        if(left > right){
            return null;
        }
        TreeNode res = new TreeNode(preorder[root]);
        Integer i = map.get(preorder[root]);
        res.left = builder(root + 1, left, i - 1);
        res.right = builder(root + i - left + 1, i + 1, right);
        return res;
    }
}