class Solution {
public:
bool isSubtree(TreeNode* root, TreeNode* subRoot) {
if(!root && !subRoot) return true;
if(!root && subRoot) return false;
if(root && !subRoot) return false;
return isequal(root,subRoot) || isSubtree(root->left,subRoot) || isSubtree(root->right,subRoot);
}
bool isequal(TreeNode* root, TreeNode* subRoot)
{
if(!root && !subRoot) return true;
if(!root && subRoot) return false;
if(root && !subRoot) return false;
if(root->val !=subRoot->val) return false;
return isequal(root->left,subRoot->left) && isequal(root->right,subRoot->right);
}
};
leetcode每日一题第136天
最新推荐文章于 2024-07-12 18:12:33 发布