4、重建二叉树

（个人水平有限，请见谅！）

题目描述：

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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:
    TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
        int in = vin.size();
        if (in == 0)
            return NULL;
        
        vector <int> leftpre, rightpre, leftvin, rightvin;
        
        TreeNode* Head = new TreeNode(pre[0]);
        
        int cut = 0;
        
        for (int i = 0; i < in; i++)
        {
            if (vin[i] == pre[0])
            {
                cut = i;
                break;
            }
        }
        
        for (int i = 0; i < cut; i++)
        {
            leftpre.push_back(pre[i+1]);
            leftvin.push_back(vin[i]);
        }
        for (int i = cut+1; i < in; i++)
        {
            rightpre.push_back(pre[i]);
            rightvin.push_back(vin[i]);
        }
        
        Head->left = reConstructBinaryTree(leftpre, leftvin);
        Head->right = reConstructBinaryTree(rightpre, rightvin);
        
        return Head;
    }
};