想不明白咋做的一道题,又为力扣贡献了几个错误提交,下面是一个讨论区大佬的代码
代码
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);
}
消耗
时间:
内存:
默默的瞻仰大佬