树的子结构
关于树的操作很多都是通过递归完成的,归纳的方法应是:
f(pRoot1,pRoot2)=g(pRoot1,pRoot2)||f(pRoot1->left,pRoot2)||f(pRoot1->right,pRoot2);
然后一定要注意递归的出口条件,要每时每刻都要想如果指针是Null怎么办。
class Solution {
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool result = false;
if(pRoot1&&pRoot2){
result = DoesTree1HaveTree2(pRoot1,pRoot2);
if(!result){
result = HasSubtree(pRoot1->left,pRoot2);
}
if(!result){
result = HasSubtree(pRoot1->right,pRoot2);
}
}
return result;
}
bool DoesTree1HaveTree2(TreeNode* &pRoot1, TreeNode* &pRoot2)
{
bool result = false;
if(pRoot2==nullptr)return true;
if(pRoot1==nullptr)return false;
if(pRoot1->val!=pRoot2->val)result = false;
if(pRoot1->val == pRoot2->val){
result = DoesTree1HaveTree2(pRoot1->left,pRoot2->left)&&DoesTree1HaveTree2(pRoot1->right,pRoot2->right);
}
return result;
}
};