Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit0b55353

Browse files
add a solution for 993
1 parent6933963 commit0b55353

File tree

2 files changed

+66
-31
lines changed

2 files changed

+66
-31
lines changed

‎src/main/java/com/fishercoder/solutions/_993.java

Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,10 @@
22

33
importcom.fishercoder.common.classes.TreeNode;
44

5+
importjava.util.HashMap;
56
importjava.util.HashSet;
67
importjava.util.LinkedList;
8+
importjava.util.Map;
79
importjava.util.Queue;
810
importjava.util.Set;
911

@@ -45,4 +47,33 @@ private boolean checkQueue(Queue<TreeNode> queue, int x, int y) {
4547
returnset.contains(x) &&set.contains(y);
4648
}
4749
}
50+
51+
publicstaticclassSolution2 {
52+
publicbooleanisCousins(TreeNoderoot,intx,inty) {
53+
Queue<TreeNode>queue =newLinkedList<>();
54+
queue.offer(root);
55+
Map<Integer,Integer>childToParentMap =newHashMap<>();
56+
while (!queue.isEmpty()) {
57+
intsize =queue.size();
58+
childToParentMap.clear();
59+
for (inti =0;i <size;i++) {
60+
TreeNodecurr =queue.poll();
61+
if (curr.left !=null) {
62+
queue.offer(curr.left);
63+
childToParentMap.put(curr.left.val,curr.val);
64+
}
65+
if (curr.right !=null) {
66+
queue.offer(curr.right);
67+
childToParentMap.put(curr.right.val,curr.val);
68+
}
69+
}
70+
if (childToParentMap.containsKey(x) &&childToParentMap.containsKey(y) &&childToParentMap.get(x) !=childToParentMap.get(y)) {
71+
returntrue;
72+
}elseif (childToParentMap.containsKey(x) ||childToParentMap.containsKey(y)) {
73+
returnfalse;
74+
}
75+
}
76+
returnfalse;
77+
}
78+
}
4879
}

‎src/test/java/com/fishercoder/_993Test.java

Lines changed: 35 additions & 31 deletions
Original file line numberDiff line numberDiff line change
@@ -2,42 +2,46 @@
22

33
importcom.fishercoder.common.classes.TreeNode;
44
importcom.fishercoder.common.utils.TreeUtils;
5-
importcom.fishercoder.solutions._703;
6-
importcom.fishercoder.solutions._976;
75
importcom.fishercoder.solutions._993;
8-
importjava.util.Arrays;
96
importorg.junit.BeforeClass;
107
importorg.junit.Test;
118

9+
importjava.util.Arrays;
10+
1211
importstaticjunit.framework.Assert.assertEquals;
1312

1413
publicclass_993Test {
15-
privatestatic_993.Solution1solution1;
16-
privatestaticTreeNoderoot;
17-
18-
@BeforeClass
19-
publicstaticvoidsetUp() {
20-
solution1 =new_993.Solution1();
21-
}
22-
23-
@Test
24-
publicvoidtest1() {
25-
root =TreeUtils.constructBinaryTree(Arrays.asList(1,2,3,4));
26-
TreeUtils.printBinaryTree(root);
27-
assertEquals(false,solution1.isCousins(root,4,3));
28-
}
29-
30-
@Test
31-
publicvoidtest2() {
32-
root =TreeUtils.constructBinaryTree(Arrays.asList(1,2,3,null,4,null,5));
33-
TreeUtils.printBinaryTree(root);
34-
assertEquals(true,solution1.isCousins(root,5,4));
35-
}
36-
37-
@Test
38-
publicvoidtest3() {
39-
root =TreeUtils.constructBinaryTree(Arrays.asList(1,2,3,null,4));
40-
TreeUtils.printBinaryTree(root);
41-
assertEquals(false,solution1.isCousins(root,2,3));
42-
}
14+
privatestatic_993.Solution1solution1;
15+
privatestatic_993.Solution2solution2;
16+
privatestaticTreeNoderoot;
17+
18+
@BeforeClass
19+
publicstaticvoidsetUp() {
20+
solution1 =new_993.Solution1();
21+
solution2 =new_993.Solution2();
22+
}
23+
24+
@Test
25+
publicvoidtest1() {
26+
root =TreeUtils.constructBinaryTree(Arrays.asList(1,2,3,4));
27+
TreeUtils.printBinaryTree(root);
28+
assertEquals(false,solution1.isCousins(root,4,3));
29+
assertEquals(false,solution2.isCousins(root,4,3));
30+
}
31+
32+
@Test
33+
publicvoidtest2() {
34+
root =TreeUtils.constructBinaryTree(Arrays.asList(1,2,3,null,4,null,5));
35+
TreeUtils.printBinaryTree(root);
36+
assertEquals(true,solution1.isCousins(root,5,4));
37+
assertEquals(true,solution2.isCousins(root,5,4));
38+
}
39+
40+
@Test
41+
publicvoidtest3() {
42+
root =TreeUtils.constructBinaryTree(Arrays.asList(1,2,3,null,4));
43+
TreeUtils.printBinaryTree(root);
44+
assertEquals(false,solution1.isCousins(root,2,3));
45+
assertEquals(false,solution2.isCousins(root,2,3));
46+
}
4347
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp