/**
* 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:
unordered_map<int,int> mp;
TreeNode* dfs(vector<int>& preorder, vector<int>& inorder,int pl,int pr,int il,int ir)
{
if(pl>pr)return nullptr; // 特判!!!
int w=preorder[pl]; // 本层根结点的值
int k=mp[w];
int len=k-il; // 左子树结点个数
//建树
TreeNode* rootv=new TreeNode(w);
rootv->left=dfs(preorder,inorder,pl+1,pl+len,il,k-1);
rootv->right=dfs(preorder,inorder,pl+len+1,pr,k+1,ir);
return rootv;
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
int n=inorder.size();
for(int i=0;i<n;i++)mp[inorder[i]]=i; // 哈希表mp[x]存储键值x在inorder中的位置
return dfs(preorder,inorder,0,n-1,0,n-1);
}
};
lc105
最新推荐文章于 2024-07-19 15:45:46 发布