LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

For example, given

preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
Return the following binary tree:

题目大意 给出前序遍历和中序遍历 让我求出这个二叉树来。
根据 前序 根左右 中序左根右 所以我们可以利用前序的根 找到左右树 一次递归下去 就可以得到我们的数。具体先将数分成左和右 然后 继续分别递归，

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    unordered_map<int,int>hash;
     int pr=0;
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
     int n=inorder.size();
    for(int i=0;i<n;i++)
        hash[inorder[i]]=i;//存位置
     return build(preorder, inorder,0,n-1);
    }
    TreeNode* build(vector<int> pre, vector<int> ino,int l,int r) {
    if(l>r)
        return NULL;
    TreeNode *root = new TreeNode(pre[pr]);
    int mid = hash[pre[pr]];
    pr++;//根据前序查找
    root->left = build(pre,ino,l,mid-1);
    root->right = build(pre,ino,mid+1,r);
    return root;
    
    }
    
};