重建二叉树（C++牛客网）

解题思路：

（1）注意先序遍历和中序遍历中根结点的位置

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
        vector<int> pre_left,pre_right,vin_left,vin_right;
        if(pre.size()==0) return nullptr;
        TreeNode * root=new TreeNode(pre[0]);
        int pos=find(vin.begin(),vin.end(),pre[0])-vin.begin();
        for(int i=0;i<vin.size();i++) {
            if(i<pos) {
                vin_left.push_back(vin[i]);
                pre_left.push_back(pre[i+1]);
            } else if(i>pos) {
                vin_right.push_back(vin[i]);
                pre_right.push_back(pre[i]);
            }
        }
        TreeNode *left=reConstructBinaryTree(pre_left,vin_left);
        TreeNode *right=reConstructBinaryTree(pre_right,vin_right);
        root->left=left;
        root->right=right;
        
        return root;
    }
};