-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIsSubstructure.java
More file actions
47 lines (40 loc) · 1.01 KB
/
IsSubstructure.java
File metadata and controls
47 lines (40 loc) · 1.01 KB
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
import java.util.ArrayDeque;
import java.util.Queue;
/**
* 剑指offer 26. 树的子结构
*/
public class IsSubstructure {
public boolean isSubStructure(TreeNode A, TreeNode B) {
if(A==null || B==null){
return false;
}
Queue<TreeNode> queue = new ArrayDeque<>();
queue.add(A);
while (!queue.isEmpty()){
TreeNode node = queue.poll();
if(node.val==B.val){
if(dp(node, B)){
return true;
}
}
if(node.left!=null){
queue.add(node.left);
}
if(node.right!=null){
queue.add(node.right);
}
}
return false;
}
boolean dp(TreeNode a, TreeNode b){
if(b==null){
return true;
}else if(a==null){
return false;
}
if(a.val!=b.val){
return false;
}
return dp(a.left, b.left) && dp(a.right, b.right);
}
}