牛客BM40 重建二叉树

 给前序遍历和中序遍历

1. 创建新的节点

2.根据前序遍历的第一个元素是根节点 ， 在前序遍历中分割

/**
 * 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 a = pre.size();
        int b = vin.size();
        if(a ==0 || b == 0) return nullptr;

        //新建根节点
        TreeNode* root = new TreeNode(pre[0]);

        //循环递归重建二叉树
        for(int i = 0; i < vin.size();++i){
            if(vin[i] == pre[0]){
                vector<int> leftpre (pre.begin()+1, pre.begin()+1+i);
                vector<int> leftvin (vin.begin(),vin.begin()+i);
                root->left = reConstructBinaryTree(leftpre,leftvin);
                vector<int> rightpre (pre.begin()+1+i,pre.end());
                vector<int> rightvin (vin.begin()+i+1,vin.end());
                root->right = reConstructBinaryTree(rightpre,rightvin);
            }
        }
        return root;
    }
};

 时间复杂度O(N) 空间复杂度O(N)