【Lintcode】73. Construct Binary Tree from Preorder and Inorder Traversal

题目地址：

https://www.lintcode.com/problem/construct-binary-tree-from-preorder-and-inorder-traversal/description

给定一棵二叉树的先序遍历和中序遍历，要求返回这棵二叉树。题目保证二叉树中无重复数字。

思路是分治。由先序遍历得到二叉树的根，然后再从中序遍历中寻找树根，这样树根左边就是左子树的所有数字，右边是右子树的所有数字，再递归建左子树和右子树即可。为了加快寻找树根的速度，可以用一个哈希表记录中序遍历每个数字出现的位置。代码如下：

import java.util.HashMap;
import java.util.Map;

public class Solution {
    /**
     *@param preorder : A list of integers that preorder traversal of a tree
     *@param inorder : A list of integers that inorder traversal of a tree
     *@return : Root of a tree
     */
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        // write your code here
        if (preorder == null || inorder == null || preorder.length * inorder.length == 0 || preorder.length != inorder.length) {
            return null;
        }
    
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < inorder.length; i++) {
            map.put(inorder[i], i);
        }
        
        int len = preorder.length;
        return build(preorder, 0, len - 1, inorder, 0, len - 1, map);
    }
    
    private TreeNode build(int[] preorder, int l1, int r1, int[] inorder, int l2, int r2, Map<Integer, Integer> map) {
        if (l1 > r1) {
            return null;
        }
        
        TreeNode root = new TreeNode(preorder[l1]);
        int idx = map.get(root.val);
        int sizeLeft = idx - l2;
        root.left = build(preorder, l1 + 1, l1 + sizeLeft, inorder, l2, idx - 1, map);
        root.right = build(preorder, l1 + sizeLeft + 1, r1, inorder, idx + 1, r2, map);
        return root;
    }
}

class TreeNode {
    int val;
    TreeNode left, right;
    TreeNode(int x) {
        val = x;
    }
}

时空复杂度$O(n)$。