题目描述
blablabla
样例
blablabla
算法1
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool helper(TreeNode* pRoot1, TreeNode* pRoot2) {
if (pRoot2==NULL) return true; //子树遍历结束,说明是子结构
if (pRoot1==NULL || pRoot1->val!=pRoot2->val) return false;
return helper(pRoot1->left,pRoot2->left) && helper(pRoot1->right,pRoot2->right); //判断左右子树是否分别相同
}
bool hasSubtree(TreeNode* pRoot1, TreeNode* pRoot2) {
if (pRoot1==NULL || pRoot2==NULL) return false;
return helper(pRoot1,pRoot2) || hasSubtree(pRoot1->left,pRoot2) || hasSubtree(pRoot1->right,pRoot2);
}
};