今天的题目可谓一波三折
不知道为什么教材上的代码就是不能在LeetCode跑,参数总是有问题,看来是时候再学一波C++了
算法思想比较简单,实现比较复杂
class Solution {
public:
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
int length=preorder.size();
return rebuildtree(preorder,inorder,0,length-1,0,length-1);
}
TreeNode* rebuildtree(vector<int>& preorder,vector<int>& inorder,int preL,int preR,int inL,int inR)
{
if(preL > preR || inL > inR) return NULL;
TreeNode* root=new TreeNode(preorder[preL]);
int i;
for(i=inL;i<inR;i++)
{
if(preorder[preL]==inorder[i])//找到根节点
{
break;
}
}
root->left=rebuildtree(preorder,inorder,preL+1,preL+i-inL,inL,i-1);//根结点左边是左子树
root->right=rebuildtree(preorder,inorder,preL+i-inL+1,preR,i+1,inR);//右边是右子树
return root;
}
};