树的子结构

题目

https://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof/

解法

树的遍历注意空指针问题

public boolean isSubStructure(TreeNode A, TreeNode B) {
    boolean res = false;
    if (A != null && B!= null) {
        if (A.val == B.val) {
            res = DoesTree1HaveTree2(A, B);
        }
        if (!res) {
            res = isSubStructure(A.left, B);
        }
        if (!res) {
            res = isSubStructure(A.right, B);
        }
    }
    return res;
}

public boolean DoesTree1HaveTree2(TreeNode A, TreeNode B) {
    if (B == null) return true;
    if (A == null ) return false;
    if (A.val != B.val) {
        return false;
    }
    return DoesTree1HaveTree2(A.left, B.left) && DoesTree1HaveTree2(A.right, B.right);
}

2020-07-06

LC63_uniquePathsWithObstacles

树的子结构

题目

解法

Links

Categorias

Nube de etiquetas

Recientes

Archivos

Etiquetas

Recientes

Archivos

Etiquetas

Your browser is out-of-date!