1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
| class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
class Solution {
public boolean isSubStructure(TreeNode A, TreeNode B) {
if (A == null || B == null) {
return A == B;
}
List<TreeNode> roots = new LinkedList<>();
dfs(A, B.val, roots);
for (TreeNode root : roots) {
if (root != null && cmp(root, B)) {
return true;
}
}
return false;
}
private boolean cmp(TreeNode A, TreeNode B) {
if (A == null || B == null) {
return A == B;
}
if (A.val == B.val) {
if (B.left == null && B.right == null) {
return true;
} else if (B.left == null) {
return cmp(A.right, B.right);
} else if (B.right == null) {
return cmp(A.left, B.left);
} else {
return cmp(A.right, B.right) && cmp(A.right, B.right);
}
}
return false;
}
private void dfs(TreeNode A, int val, List<TreeNode> roots) {
if (A == null) {
return;
}
if (A.val == val) {
roots.add(A);
}
dfs(A.left, val, roots);
dfs(A.right, val, roots);
}
}
|
