剑指Offer——重建二叉树

主要思路：

利用递归把前序遍历的第一个节点存入根节点，然后递归处理左右子树

以下代码在牛客网的OJ中调试运行无误

/**
 * 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* reConstructBinaryTree(vector<int> pre,vector<int> in) 
    {
        if(pre.empty() || in.empty())
            return NULL;
        TreeNode * resultTree = new TreeNode(pre[0]);
        resultTree->left = resultTree->right = NULL;
        int i;
        for(i = 0 ;i<in.size(); ++i)
        {
            if(in[i] == pre[0])
                break;
        }
        vector<int>inLeft,inRight,preLeft,preRight;
        for(int j = 0;j<i;++j)
        {
            inLeft.push_back(in[j]);
            preLeft.push_back(pre[j+1]);
        }           
        for(int j = i+1;j<in.size();++j)
        {
            inRight.push_back(in[j]);
            preRight.push_back(pre[j]);
        }
        resultTree->left = reConstructBinaryTree(preLeft,inLeft);
        resultTree->right =  reConstructBinaryTree(preRight,inRight);
        return resultTree;
    }
};