public boolean isSubStructure(TreeNode A, TreeNode B) {
if (B == null) return false;
if (A == null) return false;
if (isSame(A, B)) return true;
return isSubStructure(A.left, B) || isSubStructure(A.right, B);
}
private boolean isSame(TreeNode node1, TreeNode node2) {
if (node2 == null) return true;
if (node1 == null) return false;
if (node1.val != node2.val) return false;
return isSame(node1.left, node2.left) && isSame(node1.right, node2.right);
}
剑指 Offer 26. 树的子结构
最新推荐文章于 2021-10-31 14:48:09 发布