力扣-889题 根据前序和后序遍历构造二叉树（C++）- dfs

题目链接：https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/
题目如下：


注释图：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* constructFromPrePost(vector<int>& preorder, vector<int>& postorder) {
        //注：左右节点都存在比较困难，只有单一左节点或者单一右节点比较好处理
        if(preorder.size()==0||postorder.size()==0) return nullptr;
        for(int i=0;i<postorder.size();i++){
            umap[postorder[i]]=i;//方便后面快速查找到值对应的位置 O(1)
        }
        return dfs(preorder,0,preorder.size()-1,postorder,0,postorder.size()-1);
    }
    TreeNode* dfs(vector<int>& pre,int preBegin,int preEnd,vector<int>& post,int postBegin,int postEnd){
        //1、先序
        if(preBegin>preEnd) return nullptr;
        int rootval=pre[preBegin];
        TreeNode* root=new TreeNode(rootval);
        if(preEnd==preBegin) return root;
        //2、找到在后序中的位置 把它当作中序来处理
        int k=umap[pre[preBegin+1]];
        //3、切割
        int leftpreBegin=preBegin+1;
        int leftpreEnd=preBegin+1+(k-postBegin);//加上长度
        int rightpreBegin=preBegin+1+(k-postBegin)+1;
        int rightpreEnd=preEnd;

        int leftpostBegin=postBegin;
        int leftpostEnd=k;
        int rightpostBegin=k+1;
        int rightpostEnd=postEnd-1;

        root->left=dfs(pre,leftpreBegin,leftpreEnd,post,leftpostBegin,leftpostEnd);
        root->right=dfs(pre,rightpreBegin,rightpreEnd,post,rightpostBegin,rightpostEnd);

        return root;
    }
private:
    unordered_map<int,int> umap;
};