【LeetCode No.105】从前序与中序遍历序列构造二叉树

题目链接：从前序与中序遍历序列构造二叉树

**思路：**给定了前序遍历和中序遍历，那么有已知规则：

1. 前序遍历：根 - 左 - 右
2. 中序遍历：左 - 右 - 根

那么在给定的两个数组中可以定位根节点为前序遍历的首元素，在中序遍历的数组中定位该元素所在的位置，那么就可以得到完整的左右子树，同样的道理递归找到左右子树。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    private Map<Integer, Integer> inMap;
    public TreeNode myBuildTree(int[] preorder, int preStart, int preEnd, int[] inorder, int inStart, int inEnd, Map<Integer, Integer> inMap) {
        
        if (preStart > preEnd || inStart > inEnd) return null;

        // 根据前序遍历找到根节点
        TreeNode root = new TreeNode(preorder[preStart]);
        int inRoot = inMap.get(root.val);
        int numsLeft = inRoot - inStart;

        root.left = myBuildTree(preorder, preStart + 1, preStart + numsLeft, inorder, inStart, inRoot - 1, inMap);
        root.right = myBuildTree(preorder, preStart + numsLeft + 1, preEnd, inorder, inRoot + 1, inEnd, inMap);

        return root;
    }

    public TreeNode buildTree(int[] preorder, int[] inorder) {
        int n = preorder.length;

        inMap = new HashMap<Integer, Integer>();
        for (int i = 0; i < n; i++) {
            inMap.put(inorder[i], i);
        }

        return myBuildTree(preorder, 0, n - 1, inorder, 0, n - 1, inMap);
    }
}