leetcode中等剑指 Offer 26树的子结构

Posted 2021-11-07 qq_40707462

思路：递归

class Solution {
    public boolean isSubStructure(TreeNode A, TreeNode B) {
        if(A==null || B==null) return false;
        return dfs(A,B) || isSubStructure(A.left,B) || isSubStructure(A.right,B);
    }
    public boolean dfs(TreeNode A,TreeNode B){
        if(B==null) return true;
        if(A==null) return false;
        return A.val==B.val && dfs(A.left,B.left) &&dfs(A.right,B.right);

    }
}