重建二叉树

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    using It = vector<int>::iterator;
    TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
        return reSolver(begin(pre), end(pre), begin(vin), end(vin));
    }
private:
    TreeNode* reSolver(It begPre, It endPre, It begVin, It endVin) {
        TreeNode* ret = new TreeNode(*begPre);
        It it = find(begVin, endVin, *begPre);
        int numPre = it - begVin;
        int numPost = endVin - (it + 1);
        ret->left = numPre != 0 ? reSolver(begPre + 1, begPre + 1 + numPre, begVin, it) : nullptr;
        ret->right = numPost != 0 ? reSolver(begPre + 1 + numPre, endPre, it + 1, endVin) : nullptr;
        return ret;
    }
};