【leetcode 二叉树 C++】【剑指 Offer】 07. 重建二叉树

剑指 Offer 07. 重建二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* BuildTree(vector<int> &preorder, vector<int> &inorder, int preL, int preR, int inL, int inR) {
        if(preL == preR || inL == inR) return NULL;
        TreeNode* root = new TreeNode(preorder[preL]);
        int cnt = 0;
        while(inorder[inL+cnt] != preorder[preL]) cnt++;
        root->left = BuildTree(preorder, inorder, preL+1, preL+1+cnt, inL, inL+cnt);
        root->right = BuildTree(preorder, inorder, preL+1+cnt, preR, inL+cnt+1, inR);
        return root;
    }
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        return BuildTree(preorder, inorder, 0, preorder.size(), 0, inorder.size());
    }
};

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        if(preorder.size() == 0 || inorder.size() == 0) return NULL;
        TreeNode* root = new TreeNode(preorder[0]);
        int cnt = 0;
        while(inorder[cnt] != preorder[0]) cnt++;

        vector<int> left_preorder(preorder.begin()+1, preorder.begin()+1+cnt);
        vector<int> left_inorder(inorder.begin(), inorder.begin()+cnt);

        root->left = buildTree(left_preorder, left_inorder);

        vector<int> right_preorder(preorder.begin()+1+cnt, preorder.end());
        vector<int> right_inorder(inorder.begin()+cnt+1, inorder.end());

        root->right = buildTree(right_preorder, right_inorder);
        return root;
    }
};