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

Commited492ec

Browse files
authored
Added tests for tasks 101-2929
1 parent4ee679b commited492ec

File tree

5 files changed

+188
-0
lines changed

5 files changed

+188
-0
lines changed

‎src/test/java/g0101_0200/s0101_symmetric_tree/SolutionTest.java‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,4 +20,33 @@ void symmetricTree2() {
2020
TreeNoderoot =TreeUtils.constructBinaryTree(Arrays.asList(1,2,2,null,3,null,3));
2121
assertThat(newSolution().isSymmetric(root),equalTo(false));
2222
}
23+
24+
@Test
25+
voidsymmetricTree3() {
26+
assertThat(newSolution().isSymmetric(null),equalTo(true));
27+
}
28+
29+
@Test
30+
voidsymmetricTree4() {
31+
TreeNoderoot =newTreeNode(1);
32+
assertThat(newSolution().isSymmetric(root),equalTo(true));
33+
}
34+
35+
@Test
36+
voidsymmetricTree5() {
37+
TreeNoderoot =newTreeNode(1,newTreeNode(2),null);
38+
assertThat(newSolution().isSymmetric(root),equalTo(false));
39+
}
40+
41+
@Test
42+
voidsymmetricTree6() {
43+
TreeNoderoot =newTreeNode(1,null,newTreeNode(2));
44+
assertThat(newSolution().isSymmetric(root),equalTo(false));
45+
}
46+
47+
@Test
48+
voidsymmetricTree7() {
49+
TreeNoderoot =TreeUtils.constructBinaryTree(Arrays.asList(1,2,2,3,4,5,3));
50+
assertThat(newSolution().isSymmetric(root),equalTo(false));
51+
}
2352
}

‎src/test/java/g0101_0200/s0198_house_robber/SolutionTest.java‎

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,34 @@ void rob() {
1515
voidrob2() {
1616
assertThat(newSolution().rob(newint[] {2,7,9,3,1}),equalTo(12));
1717
}
18+
19+
@Test
20+
voidrob3() {
21+
assertThat(newSolution().rob(newint[] {5}),equalTo(5));
22+
}
23+
24+
@Test
25+
voidrob4() {
26+
assertThat(newSolution().rob(newint[] {5,10}),equalTo(10));
27+
}
28+
29+
@Test
30+
voidrob5() {
31+
assertThat(newSolution().rob(newint[] {2,1,1,2}),equalTo(4));
32+
}
33+
34+
@Test
35+
voidrob6() {
36+
assertThat(newSolution().rob(newint[] {3,3,3,3,3}),equalTo(9));
37+
}
38+
39+
@Test
40+
voidrob7() {
41+
assertThat(newSolution().rob(newint[] {100,1,100,1,100}),equalTo(300));
42+
}
43+
44+
@Test
45+
voidrob8() {
46+
assertThat(newSolution().rob(newint[] {}),equalTo(0));
47+
}
1848
}

‎src/test/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueueTest.java‎

Lines changed: 62 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,66 @@ void queueUsingStacks() {
1515
assertThat(myQueue.pop(),equalTo(1));
1616
assertThat(myQueue.empty(),equalTo(false));
1717
}
18+
19+
@Test
20+
voidqueuePushPopPeekMultiple() {
21+
MyQueuemyQueue =newMyQueue();
22+
myQueue.push(10);
23+
myQueue.push(20);
24+
myQueue.push(30);
25+
26+
assertThat(myQueue.peek(),equalTo(10));
27+
assertThat(myQueue.pop(),equalTo(10));
28+
assertThat(myQueue.peek(),equalTo(20));
29+
assertThat(myQueue.pop(),equalTo(20));
30+
assertThat(myQueue.peek(),equalTo(30));
31+
assertThat(myQueue.pop(),equalTo(30));
32+
assertThat(myQueue.empty(),equalTo(true));
33+
}
34+
35+
@Test
36+
voidqueueEmptyInitially() {
37+
MyQueuemyQueue =newMyQueue();
38+
assertThat(myQueue.empty(),equalTo(true));
39+
}
40+
41+
@Test
42+
voidqueuePushAfterPopAll() {
43+
MyQueuemyQueue =newMyQueue();
44+
myQueue.push(1);
45+
myQueue.push(2);
46+
assertThat(myQueue.pop(),equalTo(1));
47+
assertThat(myQueue.pop(),equalTo(2));
48+
assertThat(myQueue.empty(),equalTo(true));
49+
50+
myQueue.push(3);
51+
assertThat(myQueue.peek(),equalTo(3));
52+
assertThat(myQueue.empty(),equalTo(false));
53+
}
54+
55+
@Test
56+
voidqueuePeekDoesNotRemove() {
57+
MyQueuemyQueue =newMyQueue();
58+
myQueue.push(5);
59+
myQueue.push(6);
60+
assertThat(myQueue.peek(),equalTo(5));
61+
assertThat(myQueue.peek(),equalTo(5));
62+
assertThat(myQueue.pop(),equalTo(5));
63+
assertThat(myQueue.peek(),equalTo(6));
64+
}
65+
66+
@Test
67+
voidpushAfterPopTriggersRightToLeft() {
68+
MyQueuemyQueue =newMyQueue();
69+
myQueue.push(1);
70+
myQueue.push(2);
71+
72+
assertThat(myQueue.pop(),equalTo(1));
73+
74+
myQueue.push(3);
75+
76+
assertThat(myQueue.pop(),equalTo(2));
77+
assertThat(myQueue.pop(),equalTo(3));
78+
assertThat(myQueue.empty(),equalTo(true));
79+
}
1880
}

‎src/test/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/SolutionTest.java‎

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -42,4 +42,36 @@ void lowestCommonAncestor3() {
4242
.val,
4343
equalTo(2));
4444
}
45+
46+
@Test
47+
voidlowestCommonAncestor4() {
48+
TreeNoderoot =newTreeNode(1);
49+
assertThat(
50+
newSolution().lowestCommonAncestor(root,newTreeNode(1),newTreeNode(1)).val,
51+
equalTo(1));
52+
}
53+
54+
@Test
55+
voidlowestCommonAncestor5() {
56+
TreeNoderoot =newTreeNode(3,newTreeNode(1),newTreeNode(4));
57+
assertThat(
58+
newSolution().lowestCommonAncestor(root,newTreeNode(1),newTreeNode(1)).val,
59+
equalTo(1));
60+
}
61+
62+
@Test
63+
voidlowestCommonAncestor6() {
64+
TreeNoderoot =newTreeNode(3,newTreeNode(1),newTreeNode(4));
65+
assertThat(
66+
newSolution().lowestCommonAncestor(root,newTreeNode(4),newTreeNode(4)).val,
67+
equalTo(4));
68+
}
69+
70+
@Test
71+
voidlowestCommonAncestor7() {
72+
TreeNoderoot =newTreeNode(5,newTreeNode(3),newTreeNode(8));
73+
assertThat(
74+
newSolution().lowestCommonAncestor(root,newTreeNode(3),newTreeNode(8)).val,
75+
equalTo(5));
76+
}
4577
}

‎src/test/java/g2901_3000/s2929_distribute_candies_among_children_ii/SolutionTest.java‎

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,39 @@ void distributeCandies() {
1515
voiddistributeCandies2() {
1616
assertThat(newSolution().distributeCandies(3,3),equalTo(10L));
1717
}
18+
19+
@Test
20+
voiddistributeCandies3() {
21+
assertThat(newSolution().distributeCandies(2,5),equalTo(6L));
22+
}
23+
24+
@Test
25+
voiddistributeCandies4() {
26+
assertThat(newSolution().distributeCandies(4,4),equalTo(15L));
27+
}
28+
29+
@Test
30+
voiddistributeCandies5() {
31+
assertThat(newSolution().distributeCandies(7,5),equalTo(27L));
32+
}
33+
34+
@Test
35+
voiddistributeCandies6() {
36+
assertThat(newSolution().distributeCandies(12,5),equalTo(10L));
37+
}
38+
39+
@Test
40+
voiddistributeCandies7() {
41+
assertThat(newSolution().distributeCandies(20,5),equalTo(0L));
42+
}
43+
44+
@Test
45+
voiddistributeCandies8() {
46+
assertThat(newSolution().distributeCandies(10,5),equalTo(21L));
47+
}
48+
49+
@Test
50+
voiddistributeCandies9() {
51+
assertThat(newSolution().distributeCandies(15,5),equalTo(1L));
52+
}
1853
}

0 commit comments

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