/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
int len=vin.size();
if(len==0)
return nullptr;
int originRoot=0;
vector<int> left_pre,left_in,right_pre,right_in;
TreeNode *head=new TreeNode(pre[0]);
for(int i=0;i<vin.size();i++)
if(pre[0]==vin[i])
originRoot=i;
for(int i=0;i<originRoot;i++)
{
left_pre.push_back(pre[i+1]);
left_in.push_back(vin[i]);
}
for(int i=originRoot+1;i<len;i++)
{
right_pre.push_back(pre[i]);
right_in.push_back(vin[i]);
}
head->left=reConstructBinaryTree(left_pre,left_in);
head->right=reConstructBinaryTree(right_pre,right_in);
return head;
}
};
重建二叉树
最新推荐文章于 2022-05-26 16:40:57 发布