题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:
递归、判断 return (dfs(pRoot1,pRoot2)) || HasSubtree(pRoot1->left,pRoot2) || HasSubtree(pRoot1->right,pRoot2);
思想直观
就是速度较慢,有时间再找别的解法
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(!pRoot1) return false;
if(!pRoot2) return false;
return (dfs(pRoot1,pRoot2)) || HasSubtree(pRoot1->left,pRoot2) || HasSubtree(pRoot1->right,pRoot2);
}
private:
bool dfs(TreeNode* p1, TreeNode* p2){
if(!p2) return true;
if(!p1) return false;
if(p1->val != p2->val) return false;
return dfs(p1->left,p2->left) && dfs(p1->right,p2->right);
}
};