/**
* 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 *fen(vector<int> &inorder,vector<int>& postorder){
if(postorder.size()==NULL)return NULL;
int n=postorder.size();
int k=postorder[n-1];
TreeNode *root=new TreeNode;
root->val=k;
int ge=0;
for(int i=0;i<n;i++){
if(inorder[i]==k){
ge=i;
break;
}
}
vector<int>leftinorder(inorder.begin(),inorder.begin()+ge);
vector<int>rightinorder(inorder.begin()+ge+1,inorder.end());
postorder.resize(n-1);
vector<int>leftpostorder(postorder.begin(),postorder.begin()+leftinorder.size());
vector<int>rightpostorder(postorder.begin()+leftinorder.size(),postorder.end());
root->left=fen(leftinorder,leftpostorder);
root->right=fen(rightinorder,rightpostorder);
return root;
}
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
return fen(inorder,postorder);
}
};