Skip to content

Commit b3273d7

Browse files
ThanhNITThanhNIT
authored
Added tests for tasks 33-1036
1 parent ed492ec commit b3273d7

File tree

5 files changed

+334
-0
lines changed

5 files changed

+334
-0
lines changed

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

Lines changed: 60 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,4 +20,64 @@ void search2() {
2020
void search3() {
2121
assertThat(new Solution().search(new int[] {1}, 0), equalTo(-1));
2222
}
23+
24+
@Test
25+
void search4() {
26+
assertThat(new Solution().search(new int[] {1, 2, 3, 4, 5, 6}, 4), equalTo(3));
27+
}
28+
29+
@Test
30+
void search5() {
31+
assertThat(new Solution().search(new int[] {1, 2, 3, 4, 5, 6}, 10), equalTo(-1));
32+
}
33+
34+
@Test
35+
void search6() {
36+
assertThat(new Solution().search(new int[] {6, 7, 0, 1, 2, 3, 4}, 7), equalTo(1));
37+
}
38+
39+
@Test
40+
void search7() {
41+
assertThat(new Solution().search(new int[] {6, 7, 0, 1, 2, 3, 4}, 3), equalTo(5));
42+
}
43+
44+
@Test
45+
void search8() {
46+
assertThat(new Solution().search(new int[] {5, 1}, 1), equalTo(1));
47+
}
48+
49+
@Test
50+
void search9() {
51+
assertThat(new Solution().search(new int[] {5, 1}, 2), equalTo(-1));
52+
}
53+
54+
@Test
55+
void search10() {
56+
assertThat(new Solution().search(new int[] {4, 5, 6, 7, 0, 1, 2}, 4), equalTo(0));
57+
}
58+
59+
@Test
60+
void search11() {
61+
assertThat(new Solution().search(new int[] {4, 5, 6, 7, 0, 1, 2}, 2), equalTo(6));
62+
}
63+
64+
@Test
65+
void search12() {
66+
assertThat(new Solution().search(new int[] {2, 3, 4, 5, 6, 0, 1}, 0), equalTo(5));
67+
}
68+
69+
@Test
70+
void search13() {
71+
assertThat(new Solution().search(new int[] {0, 1, 2, 3, 4, 5}, 3), equalTo(3));
72+
}
73+
74+
@Test
75+
void search14() {
76+
assertThat(new Solution().search(new int[] {5, 6, 7, 0, 1, 2, 3}, 2), equalTo(5));
77+
}
78+
79+
@Test
80+
void search15() {
81+
assertThat(new Solution().search(new int[] {5, 6, 7, 0, 1, 2, 3}, 6), equalTo(1));
82+
}
2383
}

‎src/test/java/g0601_0700/s0622_design_circular_queue/MyCircularQueueTest.java‎

Lines changed: 74 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -19,4 +19,78 @@ void myCircularQueue() {
1919
assertThat(myCircularQueue.enQueue(4), equalTo(true));
2020
assertThat(myCircularQueue.rear(), equalTo(4));
2121
}
22+
23+
@Test
24+
void myCircularQueue2() {
25+
MyCircularQueue q = new MyCircularQueue(3);
26+
assertThat(q.enQueue(1), equalTo(true));
27+
assertThat(q.enQueue(2), equalTo(true));
28+
assertThat(q.enQueue(3), equalTo(true));
29+
assertThat(q.enQueue(4), equalTo(false));
30+
assertThat(q.rear(), equalTo(3));
31+
assertThat(q.isFull(), equalTo(true));
32+
assertThat(q.deQueue(), equalTo(true));
33+
assertThat(q.enQueue(4), equalTo(true));
34+
assertThat(q.rear(), equalTo(4));
35+
}
36+
37+
@Test
38+
void myCircularQueue3() {
39+
MyCircularQueue q = new MyCircularQueue(2);
40+
assertThat(q.front(), equalTo(-1));
41+
assertThat(q.rear(), equalTo(-1));
42+
assertThat(q.deQueue(), equalTo(false));
43+
assertThat(q.isEmpty(), equalTo(true));
44+
}
45+
46+
@Test
47+
void myCircularQueue4() {
48+
MyCircularQueue q = new MyCircularQueue(1);
49+
assertThat(q.enQueue(10), equalTo(true));
50+
assertThat(q.isFull(), equalTo(true));
51+
assertThat(q.front(), equalTo(10));
52+
assertThat(q.rear(), equalTo(10));
53+
assertThat(q.deQueue(), equalTo(true));
54+
assertThat(q.isEmpty(), equalTo(true));
55+
assertThat(q.front(), equalTo(-1));
56+
assertThat(q.rear(), equalTo(-1));
57+
}
58+
59+
@Test
60+
void myCircularQueue5() {
61+
MyCircularQueue q = new MyCircularQueue(3);
62+
63+
assertThat(q.enQueue(1), equalTo(true));
64+
assertThat(q.enQueue(2), equalTo(true));
65+
assertThat(q.enQueue(3), equalTo(true));
66+
assertThat(q.isFull(), equalTo(true));
67+
68+
assertThat(q.deQueue(), equalTo(true));
69+
assertThat(q.enQueue(4), equalTo(true));
70+
71+
assertThat(q.front(), equalTo(2));
72+
assertThat(q.rear(), equalTo(4));
73+
74+
assertThat(q.deQueue(), equalTo(true));
75+
assertThat(q.deQueue(), equalTo(true));
76+
assertThat(q.deQueue(), equalTo(true));
77+
assertThat(q.deQueue(), equalTo(false));
78+
}
79+
80+
@Test
81+
void myCircularQueue6() {
82+
MyCircularQueue q = new MyCircularQueue(2);
83+
84+
assertThat(q.enQueue(5), equalTo(true));
85+
assertThat(q.enQueue(6), equalTo(true));
86+
assertThat(q.isFull(), equalTo(true));
87+
88+
assertThat(q.deQueue(), equalTo(true));
89+
assertThat(q.deQueue(), equalTo(true));
90+
assertThat(q.isEmpty(), equalTo(true));
91+
92+
assertThat(q.enQueue(7), equalTo(true));
93+
assertThat(q.front(), equalTo(7));
94+
assertThat(q.rear(), equalTo(7));
95+
}
2296
}

‎src/test/java/g0701_0800/s0782_transform_to_chessboard/SolutionTest.java‎

Lines changed: 68 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -26,4 +26,72 @@ void movesToChessboard2() {
2626
void movesToChessboard3() {
2727
assertThat(new Solution().movesToChessboard(new int[][] {{1, 0}, {1, 0}}), equalTo(-1));
2828
}
29+
30+
@Test
31+
void movesToChessboard4() {
32+
assertThat(
33+
new Solution()
34+
.movesToChessboard(
35+
new int[][] {
36+
{0, 0},
37+
{0, 1}
38+
}),
39+
equalTo(-1));
40+
}
41+
42+
@Test
43+
void movesToChessboard5() {
44+
assertThat(
45+
new Solution()
46+
.movesToChessboard(
47+
new int[][] {
48+
{1, 1},
49+
{1, 1}
50+
}),
51+
equalTo(-1));
52+
}
53+
54+
@Test
55+
void movesToChessboard6() {
56+
assertThat(
57+
new Solution()
58+
.movesToChessboard(
59+
new int[][] {
60+
{1, 0},
61+
{1, 0}
62+
}),
63+
equalTo(-1));
64+
}
65+
66+
@Test
67+
void movesToChessboard7() {
68+
assertThat(
69+
new Solution()
70+
.movesToChessboard(
71+
new int[][] {
72+
{1, 0, 1},
73+
{0, 1, 0},
74+
{1, 0, 1}
75+
}),
76+
equalTo(0));
77+
}
78+
79+
@Test
80+
void movesToChessboard8() {
81+
assertThat(
82+
new Solution()
83+
.movesToChessboard(
84+
new int[][] {
85+
{1, 0, 0, 1},
86+
{0, 1, 1, 0},
87+
{1, 0, 0, 1},
88+
{0, 1, 1, 0}
89+
}),
90+
equalTo(1));
91+
}
92+
93+
@Test
94+
void movesToChessboard9() {
95+
assertThat(new Solution().movesToChessboard(new int[][] {{0}}), equalTo(0));
96+
}
2997
}

‎src/test/java/g0901_1000/s0972_equal_rational_numbers/SolutionTest.java‎

Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,4 +20,52 @@ void isRationalEqual2() {
2020
void isRationalEqual3() {
2121
assertThat(new Solution().isRationalEqual("0.9(9)", "1."), equalTo(true));
2222
}
23+
24+
@Test
25+
void isRationalEqual4() {
26+
assertThat(new Solution().isRationalEqual("3.14", "3.14"), equalTo(true));
27+
}
28+
29+
@Test
30+
void isRationalEqual5() {
31+
assertThat(new Solution().isRationalEqual("3.14", "3.15"), equalTo(false));
32+
}
33+
34+
@Test
35+
void isRationalEqual6() {
36+
// 0.(3) = 0.3333...
37+
assertThat(new Solution().isRationalEqual("0.(3)", "0.3333333333"), equalTo(false));
38+
}
39+
40+
@Test
41+
void isRationalEqual7() {
42+
assertThat(new Solution().isRationalEqual("0.(12)", "0.(13)"), equalTo(false));
43+
}
44+
45+
@Test
46+
void isRationalEqual8() {
47+
// 1.(0) = 1.00000....
48+
assertThat(new Solution().isRationalEqual("1.(0)", "1."), equalTo(true));
49+
}
50+
51+
@Test
52+
void isRationalEqual9() {
53+
// large repeating cycle
54+
assertThat(new Solution().isRationalEqual("0.(987654321)", "0.(987654321)"), equalTo(true));
55+
}
56+
57+
@Test
58+
void isRationalEqual10() {
59+
assertThat(new Solution().isRationalEqual("42", "42"), equalTo(true));
60+
}
61+
62+
@Test
63+
void isRationalEqual11() {
64+
assertThat(new Solution().isRationalEqual("42", "42.0"), equalTo(true));
65+
}
66+
67+
@Test
68+
void isRationalEqual12() {
69+
assertThat(new Solution().isRationalEqual("0.(1)", "0.(2)"), equalTo(false));
70+
}
2371
}

‎src/test/java/g1001_1100/s1036_escape_a_large_maze/SolutionTest.java‎

Lines changed: 84 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -23,4 +23,88 @@ void isEscapePossible2() {
2323
new int[][] {}, new int[] {0, 0}, new int[] {999999, 999999}),
2424
equalTo(true));
2525
}
26+
27+
@Test
28+
void isEscapePossible3() {
29+
assertThat(
30+
new Solution()
31+
.isEscapePossible(new int[][] {{1, 1}}, new int[] {0, 0}, new int[] {1, 1}),
32+
equalTo(true));
33+
}
34+
35+
@Test
36+
void isEscapePossible4() {
37+
assertThat(
38+
new Solution()
39+
.isEscapePossible(
40+
new int[][] {{10, 10}}, new int[] {0, 0}, new int[] {0, 1}),
41+
equalTo(true));
42+
}
43+
44+
@Test
45+
void isEscapePossible5() {
46+
assertThat(
47+
new Solution()
48+
.isEscapePossible(
49+
new int[][] {{0, 2}, {1, 2}, {2, 2}},
50+
new int[] {0, 0},
51+
new int[] {3, 3}),
52+
equalTo(true));
53+
}
54+
55+
@Test
56+
void isEscapePossible6() {
57+
assertThat(
58+
new Solution()
59+
.isEscapePossible(
60+
new int[][] {{0, 1}, {0, 2}, {1, 0}, {2, 0}},
61+
new int[] {0, 0},
62+
new int[] {3, 3}),
63+
equalTo(false));
64+
}
65+
66+
@Test
67+
void isEscapePossible7() {
68+
assertThat(
69+
new Solution()
70+
.isEscapePossible(
71+
new int[][] {{999998, 999999}, {999999, 999998}},
72+
new int[] {999999, 999999},
73+
new int[] {0, 0}),
74+
equalTo(false));
75+
}
76+
77+
@Test
78+
void isEscapePossible8() {
79+
assertThat(
80+
new Solution()
81+
.isEscapePossible(
82+
new int[][] {{5, 5}, {5, 6}, {6, 5}},
83+
new int[] {5, 7},
84+
new int[] {6, 6}),
85+
equalTo(true));
86+
}
87+
88+
@Test
89+
void isEscapePossible9() {
90+
assertThat(
91+
new Solution()
92+
.isEscapePossible(new int[][] {{1, 2}}, new int[] {2, 2}, new int[] {2, 2}),
93+
equalTo(true));
94+
}
95+
96+
@Test
97+
void isEscapePossible10() {
98+
assertThat(
99+
new Solution().isEscapePossible(new int[][] {}, new int[] {0, 0}, new int[] {0, 1}),
100+
equalTo(true));
101+
}
102+
103+
@Test
104+
void isEscapePossible11() {
105+
assertThat(
106+
new Solution()
107+
.isEscapePossible(new int[][] {{2, 2}}, new int[] {2, 1}, new int[] {2, 2}),
108+
equalTo(true));
109+
}
26110
}

0 commit comments

Comments
 (0)