题目描述:
代码:
用unordered_map代替 循环寻找index(每个结点的值都不一样)
/**
* 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>findindex;
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
for(int i=0;i<inorder.size();i++)
{
findindex.emplace(inorder[i],i);
}
return build(preorder,0,preorder.size()-1,inorder,0,inorder.size()-1);
}
TreeNode* build(vector<int>& preorder,int prestart,int preend, vector<int>& inorder,int instart,int inend)
{
if(prestart>preend)
return nullptr;
int rootval=preorder[prestart];
TreeNode* root=new TreeNode(rootval);
int index;
index=findindex.at(rootval); //返回容器中存储的键 key 对应的值
// for(int i=instart;i<=inend;i++)
// {
// if(inorder[i]==rootval)
// {
// index=i;
// break;
// }
// }
int leftsize=index-instart;
root->left=build(preorder,prestart+1,prestart+leftsize,
inorder,instart,index-1);
root->right=build(preorder,prestart+leftsize+1,preend,
inorder,index+1,inend);
return root;
}
};