牛客OJ：判断子结构和子树

最新推荐文章于 2024-08-21 16:01:17 发布

ShellDawn

最新推荐文章于 2024-08-21 16:01:17 发布

阅读量194

点赞数

CC 4.0 BY-SA版权

分类专栏： NewCoder OJ 文章标签：牛客OJ

本文链接：https://blog.youkuaiyun.com/ShellDawn/article/details/89069722

NewCoder OJ 专栏收录该内容

37 篇文章

订阅专栏

判断子结构：

class Solution {
public:
    bool solve(TreeNode* a, TreeNode* b){
        if(b == NULL) return true;
        if(a == NULL) return false;
        if(a->val == b->val){
            return 
                solve(a->left,b->left)
                && 
                solve(a->right,b->right);
        }
        return false;
    }
    bool judge(TreeNode* a,TreeNode* b){
        if(a == NULL || b == NULL) return false;
        bool ans = false;
        if(a->val == b->val) ans = (ans || solve(a,b));
        if(ans) return true;
        ans = (ans || judge(a->left,b));
        ans = (ans || judge(a->right,b));
        return ans;
    }
    bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
    {
        return judge(pRoot1,pRoot2);
    }
};

判断子树：

bool solve(TreeNode* a, TreeNode* b){
    if(a == NULL && b == NULL) return true;
    if(a == NULL || b == NULL) return false;
    if(a->val == b->val){
        return 
            solve(a->left,b->left)
            && 
            solve(a->right,b->right);
    }
    return false;
}
bool judge(TreeNode* a,TreeNode* b){
    if(a == NULL || b == NULL) return false;
    bool ans = false;
    if(a->val == b->val) ans = (ans || solve(a,b));
    if(ans) return true;
    ans = (ans || judge(a->left,b));
    ans = (ans || judge(a->right,b));
    return ans;
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
    return judge(pRoot1,pRoot2);
}