leetcode106. 从中序与后序遍历序列构造二叉树

1、题目

https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/

2、题意

题解1：做法和leetcode105类似 开个哈希表记录中序便利值的索引
后序的最后一个节点为根 找到在中序中的位置…

/**
 * 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:
    map<int,int> pos;
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        for(int i=0;i<inorder.size();i++)
            pos[inorder[i]] = i;
        return build(inorder,postorder,0,inorder.size()-1,0,postorder.size()-1);
    }
    TreeNode* build(vector<int>&in,vector<int>&post,int il,int ir,int postl,int postr)
    {
        if(il>ir) return NULL;
        auto root = new TreeNode(post[postr]);
        int k = pos[root->val];
        root->left = build(in,post,il,k-1,postl,postl+k-1-il);
        root->right = build(in,post,k+1,ir,postl+k-1-il+1,postr-1);
        return root;
    }
};