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

Commit4ee679b

Browse files
authored
Added tests for tasks 84-2425
1 parent03752f7 commit4ee679b

File tree

5 files changed

+194
-0
lines changed

5 files changed

+194
-0
lines changed

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

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,44 @@ void largestRectangleArea() {
1515
voidlargestRectangleArea2() {
1616
assertThat(newSolution().largestRectangleArea(newint[] {2,4}),equalTo(4));
1717
}
18+
19+
@Test
20+
voidlargestRectangleArea3() {
21+
assertThat(newSolution().largestRectangleArea(newint[] {}),equalTo(0));
22+
}
23+
24+
@Test
25+
voidlargestRectangleArea4() {
26+
assertThat(newSolution().largestRectangleArea(newint[] {5}),equalTo(5));
27+
}
28+
29+
@Test
30+
voidlargestRectangleArea5() {
31+
assertThat(newSolution().largestRectangleArea(newint[] {3,6}),equalTo(6));
32+
}
33+
34+
@Test
35+
voidlargestRectangleArea6() {
36+
assertThat(newSolution().largestRectangleArea(newint[] {2,2,2,2}),equalTo(8));
37+
}
38+
39+
@Test
40+
voidlargestRectangleArea7() {
41+
assertThat(newSolution().largestRectangleArea(newint[] {1,2,3,4,5}),equalTo(9));
42+
}
43+
44+
@Test
45+
voidlargestRectangleArea8() {
46+
assertThat(newSolution().largestRectangleArea(newint[] {5,4,3,2,1}),equalTo(9));
47+
}
48+
49+
@Test
50+
voidlargestRectangleArea9() {
51+
assertThat(newSolution().largestRectangleArea(newint[] {2,1,5,6,2,3}),equalTo(10));
52+
}
53+
54+
@Test
55+
voidlargestRectangleArea10() {
56+
assertThat(newSolution().largestRectangleArea(newint[] {1,1,1,1}),equalTo(4));
57+
}
1858
}

‎src/test/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinderTest.java‎

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -29,4 +29,50 @@ void medianFinder2() {
2929
medianFinder.addNum(-1);
3030
assertThat(medianFinder.findMedian(),equalTo(1.0));
3131
}
32+
33+
@Test
34+
voidmedianFinder3() {
35+
MedianFindermedianFinder =newMedianFinder();
36+
medianFinder.addNum(42);
37+
assertThat(medianFinder.findMedian(),equalTo(42.0));
38+
}
39+
40+
@Test
41+
voidmedianFinder4() {
42+
MedianFindermedianFinder =newMedianFinder();
43+
medianFinder.addNum(5);
44+
medianFinder.addNum(5);
45+
medianFinder.addNum(5);
46+
medianFinder.addNum(5);
47+
assertThat(medianFinder.findMedian(),equalTo(5.0));
48+
}
49+
50+
@Test
51+
voidmedianFinder5() {
52+
MedianFindermedianFinder =newMedianFinder();
53+
medianFinder.addNum(-5);
54+
medianFinder.addNum(-10);
55+
medianFinder.addNum(-3);
56+
assertThat(medianFinder.findMedian(),equalTo(-5.0));
57+
}
58+
59+
@Test
60+
voidmedianFinder6() {
61+
MedianFindermedianFinder =newMedianFinder();
62+
medianFinder.addNum(1000);
63+
medianFinder.addNum(1);
64+
medianFinder.addNum(500);
65+
medianFinder.addNum(0);
66+
assertThat(medianFinder.findMedian(),equalTo(250.5));
67+
}
68+
69+
@Test
70+
voidmedianFinder7() {
71+
MedianFindermedianFinder =newMedianFinder();
72+
medianFinder.addNum(1);
73+
medianFinder.addNum(2);
74+
medianFinder.addNum(3);
75+
medianFinder.addNum(4);
76+
assertThat(medianFinder.findMedian(),equalTo(2.5));
77+
}
3278
}

‎src/test/java/g0801_0900/s0858_mirror_reflection/SolutionTest.java‎

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,39 @@ void mirrorReflection() {
1515
voidmirrorReflection2() {
1616
assertThat(newSolution().mirrorReflection(3,1),equalTo(1));
1717
}
18+
19+
@Test
20+
voidmirrorReflection3() {
21+
assertThat(newSolution().mirrorReflection(4,2),equalTo(2));
22+
}
23+
24+
@Test
25+
voidmirrorReflection4() {
26+
assertThat(newSolution().mirrorReflection(6,3),equalTo(2));
27+
}
28+
29+
@Test
30+
voidmirrorReflection5() {
31+
assertThat(newSolution().mirrorReflection(5,2),equalTo(0));
32+
}
33+
34+
@Test
35+
voidmirrorReflection6() {
36+
assertThat(newSolution().mirrorReflection(7,3),equalTo(1));
37+
}
38+
39+
@Test
40+
voidmirrorReflection7() {
41+
assertThat(newSolution().mirrorReflection(1000,250),equalTo(2));
42+
}
43+
44+
@Test
45+
voidmirrorReflection8() {
46+
assertThat(newSolution().mirrorReflection(4,4),equalTo(1));
47+
}
48+
49+
@Test
50+
voidmirrorReflection9() {
51+
assertThat(newSolution().mirrorReflection(1,1),equalTo(1));
52+
}
1853
}

‎src/test/java/g1901_2000/s1901_find_a_peak_element_ii/SolutionTest.java‎

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@
22

33
importstaticorg.hamcrest.CoreMatchers.equalTo;
44
importstaticorg.hamcrest.MatcherAssert.assertThat;
5+
importstaticorg.junit.jupiter.api.Assertions.assertTrue;
56

67
importorg.junit.jupiter.api.Test;
78

@@ -19,4 +20,46 @@ void findPeakGrid2() {
1920
newSolution().findPeakGrid(newint[][] {{10,20,15}, {21,30,14}, {7,16,32}}),
2021
equalTo(newint[] {1,1}));
2122
}
23+
24+
@Test
25+
voidfindPeakGrid3() {
26+
assertThat(
27+
newSolution().findPeakGrid(newint[][] {{1,3,2,4}}),equalTo(newint[] {0,1}));
28+
}
29+
30+
@Test
31+
voidfindPeakGrid4() {
32+
assertThat(
33+
newSolution().findPeakGrid(newint[][] {{1}, {3}, {2}, {4}}),
34+
equalTo(newint[] {3,0}));
35+
}
36+
37+
@Test
38+
voidfindPeakGrid5() {
39+
assertThat(
40+
newSolution().findPeakGrid(newint[][] {{2,2}, {2,2}}),
41+
equalTo(newint[] {0,1}));
42+
}
43+
44+
@Test
45+
voidfindPeakGrid6() {
46+
int[][]mat = {
47+
{1,2,3,6},
48+
{5,6,7,8},
49+
{4,3,2,1}
50+
};
51+
int[]peak =newSolution().findPeakGrid(mat);
52+
assertTrue(peak[0] >=0 &&peak[1] >=0);
53+
intval =mat[peak[0]][peak[1]];
54+
intup =peak[0] >0 ?mat[peak[0] -1][peak[1]] : -1;
55+
intdown =peak[0] <mat.length -1 ?mat[peak[0] +1][peak[1]] : -1;
56+
intleft =peak[1] >0 ?mat[peak[0]][peak[1] -1] : -1;
57+
intright =peak[1] <mat[0].length -1 ?mat[peak[0]][peak[1] +1] : -1;
58+
assertTrue(val >up &&val >down &&val >left &&val >right);
59+
}
60+
61+
@Test
62+
voidfindPeakGrid7() {
63+
assertThat(newSolution().findPeakGrid(newint[][] {{5}}),equalTo(newint[] {0,0}));
64+
}
2265
}

‎src/test/java/g2401_2500/s2425_bitwise_xor_of_all_pairings/SolutionTest.java‎

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -17,4 +17,34 @@ void xorAllNums() {
1717
voidxorAllNums2() {
1818
assertThat(newSolution().xorAllNums(newint[] {1,2},newint[] {3,4}),equalTo(0));
1919
}
20+
21+
@Test
22+
voidxorAllNums3() {
23+
assertThat(newSolution().xorAllNums(newint[] {7},newint[] {1,2,3}),equalTo(7));
24+
}
25+
26+
@Test
27+
voidxorAllNums4() {
28+
assertThat(newSolution().xorAllNums(newint[] {1,2,3},newint[] {5}),equalTo(5));
29+
}
30+
31+
@Test
32+
voidxorAllNums5() {
33+
assertThat(newSolution().xorAllNums(newint[] {8},newint[] {6}),equalTo(14));
34+
}
35+
36+
@Test
37+
voidxorAllNums6() {
38+
assertThat(newSolution().xorAllNums(newint[] {},newint[] {1,2,3}),equalTo(0));
39+
}
40+
41+
@Test
42+
voidxorAllNums7() {
43+
assertThat(newSolution().xorAllNums(newint[] {4,5,6},newint[] {}),equalTo(0));
44+
}
45+
46+
@Test
47+
voidxorAllNums8() {
48+
assertThat(newSolution().xorAllNums(newint[] {},newint[] {}),equalTo(0));
49+
}
2050
}

0 commit comments

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