剑指offer题四重建二叉树

题目描述
输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。
假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如输入前序遍历序列{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:
    struct TreeNode* construct(vector<int> pre, int ps, int pe, vector<int> vin, int vs, int ve)
    {
        TreeNode* node = new TreeNode(pre[ps]);
        int i;
        for(i = vs; vin[i] != node->val; i++);
        int l = i - vs;
        int r = ve - i;
        if(l)
            node->left = construct(pre, ps+1, ps+l, vin, vs, vs+l-1);
        else
            node->left = nullptr;
        if(r)
            node->right = construct(pre, pe-r+1, pe, vin, ve-r+1, ve);
        else
            node->right = nullptr;
        return node;
    }
    struct TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) 
    {
        if(pre.size() == 0 || vin.size() == 0 || pre.size() != vin.size())
            return nullptr;
        return construct(pre, 0, pre.size()-1, vin, 0, vin.size()-1);
    }
};