LCR 143. 子结构判断

LCR 143. 子结构判断_第1张图片

LCR 143. 子结构判断_第2张图片

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

你可能感兴趣的:(java,leetcode,数据结构,算法)