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

Commit9466867

Browse files
authored
Added tests for tasks 8-3548
1 parent217ecc4 commit9466867

File tree

5 files changed

+241
-0
lines changed

5 files changed

+241
-0
lines changed

‎src/test/java/g0001_0100/s0008_string_to_integer_atoi/SolutionTest.java‎

Lines changed: 60 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -30,4 +30,64 @@ void myAtoi4() {
3030
voidmyAtoi5() {
3131
assertThat(newSolution().myAtoi("-91283472332"),equalTo(-2147483648));
3232
}
33+
34+
@Test
35+
voidmyAtoi6() {
36+
assertThat(newSolution().myAtoi("123"),equalTo(123));
37+
}
38+
39+
@Test
40+
voidmyAtoi7() {
41+
assertThat(newSolution().myAtoi("+456"),equalTo(456));
42+
}
43+
44+
@Test
45+
voidmyAtoi8() {
46+
assertThat(newSolution().myAtoi("0000123"),equalTo(123));
47+
}
48+
49+
@Test
50+
voidmyAtoi9() {
51+
assertThat(newSolution().myAtoi("2147483648"),equalTo(Integer.MAX_VALUE));
52+
}
53+
54+
@Test
55+
voidmyAtoi10() {
56+
assertThat(newSolution().myAtoi("-2147483649"),equalTo(Integer.MIN_VALUE));
57+
}
58+
59+
@Test
60+
voidmyAtoi11() {
61+
assertThat(newSolution().myAtoi(""),equalTo(0));
62+
}
63+
64+
@Test
65+
voidmyAtoi12() {
66+
assertThat(newSolution().myAtoi(" "),equalTo(0));
67+
}
68+
69+
@Test
70+
voidmyAtoi13() {
71+
assertThat(newSolution().myAtoi("+-2"),equalTo(0));
72+
}
73+
74+
@Test
75+
voidmyAtoi14() {
76+
assertThat(newSolution().myAtoi("0"),equalTo(0));
77+
}
78+
79+
@Test
80+
voidmyAtoi15() {
81+
assertThat(newSolution().myAtoi("-0"),equalTo(0));
82+
}
83+
84+
@Test
85+
voidmyAtoi16() {
86+
assertThat(newSolution().myAtoi("words 123"),equalTo(0));
87+
}
88+
89+
@Test
90+
voidmyAtoi17() {
91+
assertThat(newSolution().myAtoi(" 0000000000012345678abc"),equalTo(12345678));
92+
}
3393
}

‎src/test/java/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.java‎

Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -23,4 +23,38 @@ void distanceBetweenBusStops3() {
2323
assertThat(
2424
newSolution().distanceBetweenBusStops(newint[] {1,2,3,4},0,3),equalTo(4));
2525
}
26+
27+
@Test
28+
voiddistanceBetweenBusStops4() {
29+
assertThat(
30+
newSolution().distanceBetweenBusStops(newint[] {1,2,3,4},3,1),equalTo(5));
31+
}
32+
33+
@Test
34+
voiddistanceBetweenBusStops5() {
35+
assertThat(
36+
newSolution().distanceBetweenBusStops(newint[] {7,1,2,3},1,3),equalTo(3));
37+
}
38+
39+
@Test
40+
voiddistanceBetweenBusStops6() {
41+
assertThat(
42+
newSolution().distanceBetweenBusStops(newint[] {2,2,2,2},1,3),equalTo(4));
43+
}
44+
45+
@Test
46+
voiddistanceBetweenBusStops7() {
47+
assertThat(newSolution().distanceBetweenBusStops(newint[] {5},0,0),equalTo(0));
48+
}
49+
50+
@Test
51+
voiddistanceBetweenBusStops8() {
52+
assertThat(newSolution().distanceBetweenBusStops(newint[] {3,8},1,0),equalTo(3));
53+
}
54+
55+
@Test
56+
voiddistanceBetweenBusStops9() {
57+
assertThat(
58+
newSolution().distanceBetweenBusStops(newint[] {1,4,6,3},2,1),equalTo(4));
59+
}
2660
}

‎src/test/java/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.java‎

Lines changed: 50 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,4 +20,54 @@ void assignTasks2() {
2020
.assignTasks(newint[] {5,1,4,3,2},newint[] {2,1,2,4,5,2,1}),
2121
equalTo(newint[] {1,4,1,4,1,3,2}));
2222
}
23+
24+
@Test
25+
voidassignTasks3() {
26+
assertThat(
27+
newSolution().assignTasks(newint[] {1},newint[] {1,2,3}),
28+
equalTo(newint[] {0,0,0}));
29+
}
30+
31+
@Test
32+
voidassignTasks4() {
33+
assertThat(
34+
newSolution().assignTasks(newint[] {2,2,2},newint[] {1,2,1,2}),
35+
equalTo(newint[] {0,0,1,0}));
36+
}
37+
38+
@Test
39+
voidassignTasks5() {
40+
assertThat(
41+
newSolution().assignTasks(newint[] {1,2},newint[] {1,2,3,4}),
42+
equalTo(newint[] {0,0,1,0}));
43+
}
44+
45+
@Test
46+
voidassignTasks6() {
47+
assertThat(
48+
newSolution().assignTasks(newint[] {1,2,3},newint[] {}),
49+
equalTo(newint[] {}));
50+
}
51+
52+
@Test
53+
voidassignTasks7() {
54+
assertThat(
55+
newSolution().assignTasks(newint[] {3,1,4},newint[] {5}),
56+
equalTo(newint[] {1}));
57+
}
58+
59+
@Test
60+
voidassignTasks8() {
61+
assertThat(
62+
newSolution().assignTasks(newint[] {1,2},newint[] {2,2,2}),
63+
equalTo(newint[] {0,1,0}));
64+
}
65+
66+
@Test
67+
voidassignTasks9() {
68+
int[]servers = {5,3,1,4,2};
69+
int[]tasks = {1,3,5,7,9,11};
70+
assertThat(
71+
newSolution().assignTasks(servers,tasks),equalTo(newint[] {2,2,4,1,2,3}));
72+
}
2373
}

‎src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java‎

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,44 @@ void kItemsWithMaximumSum() {
1515
voidkItemsWithMaximumSum2() {
1616
assertThat(newSolution().kItemsWithMaximumSum(3,2,0,4),equalTo(3));
1717
}
18+
19+
@Test
20+
voidkItemsWithMaximumSum3() {
21+
assertThat(newSolution().kItemsWithMaximumSum(5,3,2,5),equalTo(5));
22+
}
23+
24+
@Test
25+
voidkItemsWithMaximumSum4() {
26+
assertThat(newSolution().kItemsWithMaximumSum(3,4,5,7),equalTo(3));
27+
}
28+
29+
@Test
30+
voidkItemsWithMaximumSum5() {
31+
assertThat(newSolution().kItemsWithMaximumSum(3,1,5,6),equalTo(1));
32+
}
33+
34+
@Test
35+
voidkItemsWithMaximumSum6() {
36+
assertThat(newSolution().kItemsWithMaximumSum(2,1,10,13),equalTo(-8));
37+
}
38+
39+
@Test
40+
voidkItemsWithMaximumSum7() {
41+
assertThat(newSolution().kItemsWithMaximumSum(0,5,5,3),equalTo(0));
42+
}
43+
44+
@Test
45+
voidkItemsWithMaximumSum8() {
46+
assertThat(newSolution().kItemsWithMaximumSum(2,0,5,3),equalTo(1));
47+
}
48+
49+
@Test
50+
voidkItemsWithMaximumSum9() {
51+
assertThat(newSolution().kItemsWithMaximumSum(4,3,0,6),equalTo(4));
52+
}
53+
54+
@Test
55+
voidkItemsWithMaximumSum10() {
56+
assertThat(newSolution().kItemsWithMaximumSum(5,5,5,0),equalTo(0));
57+
}
1858
}

‎src/test/java/g3501_3600/s3548_equal_sum_grid_partition_ii/SolutionTest.java‎

Lines changed: 57 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -139,4 +139,61 @@ void canPartitionGrid23() {
139139
newSolution().canPartitionGrid(newint[][] {{2,2}, {2,2}, {1,1}}),
140140
equalTo(true));
141141
}
142+
143+
@Test
144+
voidcanPartitionGrid24() {
145+
Solutionsolution =newSolution();
146+
int[][]grid = {
147+
{2,1},
148+
{1,1}
149+
};
150+
assertThat(solution.canPartitionGrid(grid),equalTo(true));
151+
}
152+
153+
@Test
154+
voidcanPartitionGrid2325() {
155+
Solutionsolution =newSolution();
156+
int[][]grid = {{1}, {2}, {1}};
157+
assertThat(solution.canPartitionGrid(grid),equalTo(true));
158+
}
159+
160+
@Test
161+
voidcanPartitionGrid26() {
162+
Solutionsolution =newSolution();
163+
int[][]grid = {
164+
{1,2},
165+
{1,1}
166+
};
167+
assertThat(solution.canPartitionGrid(grid),equalTo(true));
168+
}
169+
170+
@Test
171+
voidcanPartitionGrid27() {
172+
Solutionsolution =newSolution();
173+
int[][]grid = {
174+
{1,1,2},
175+
{1,1,1}
176+
};
177+
assertThat(solution.canPartitionGrid(grid),equalTo(true));
178+
}
179+
180+
@Test
181+
voidcanPartitionGrid28() {
182+
Solutionsolution =newSolution();
183+
int[][]grid = {
184+
{1,1},
185+
{1,1}
186+
};
187+
assertThat(solution.canPartitionGrid(grid),equalTo(true));
188+
}
189+
190+
@Test
191+
voidcanPartitionGrid29() {
192+
Solutionsolution =newSolution();
193+
int[][]grid = {
194+
{1,2},
195+
{3,4}
196+
};
197+
assertThat(solution.canPartitionGrid(grid),equalTo(true));
198+
}
142199
}

0 commit comments

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