Skip to content

Commit 6460c77

Browse files
committed
Added tests for tasks 335-3132
1 parent f282225 commit 6460c77

File tree

5 files changed

+270
-0
lines changed

5 files changed

+270
-0
lines changed

src/test/java/g0301_0400/s0335_self_crossing/SolutionTest.java

Lines changed: 55 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -35,4 +35,59 @@ void isSelfCrossing5() {
3535
void isSelfCrossing6() {
3636
assertThat(new Solution().isSelfCrossing(new int[] {1, 1, 1}), equalTo(false));
3737
}
38+
39+
@Test
40+
void isSelfCrossing7() {
41+
assertThat(new Solution().isSelfCrossing(new int[] {3, 3, 3, 2, 1, 1}), equalTo(false));
42+
}
43+
44+
@Test
45+
void isSelfCrossing8() {
46+
assertThat(new Solution().isSelfCrossing(new int[] {2, 3, 4, 5, 6, 7}), equalTo(false));
47+
}
48+
49+
@Test
50+
void isSelfCrossing9() {
51+
assertThat(new Solution().isSelfCrossing(new int[] {2, 2, 3, 2, 2}), equalTo(true));
52+
}
53+
54+
@Test
55+
void isSelfCrossing10() {
56+
assertThat(new Solution().isSelfCrossing(new int[] {1, 1, 2, 1, 2, 1}), equalTo(true));
57+
}
58+
59+
@Test
60+
void isSelfCrossing11() {
61+
assertThat(new Solution().isSelfCrossing(new int[] {10, 20, 30, 40, 50}), equalTo(false));
62+
}
63+
64+
@Test
65+
void isSelfCrossing12() {
66+
assertThat(new Solution().isSelfCrossing(new int[] {3, 3, 4, 2, 2}), equalTo(false));
67+
}
68+
69+
@Test
70+
void isSelfCrossing13() {
71+
assertThat(new Solution().isSelfCrossing(new int[] {2, 1, 2, 1}), equalTo(true));
72+
}
73+
74+
@Test
75+
void isSelfCrossing14() {
76+
assertThat(new Solution().isSelfCrossing(new int[] {1, 2, 3, 4, 5, 6, 7, 8}), equalTo(false));
77+
}
78+
79+
@Test
80+
void isSelfCrossing15() {
81+
assertThat(new Solution().isSelfCrossing(new int[] {2, 2, 2, 2, 2, 2}), equalTo(true));
82+
}
83+
84+
@Test
85+
void isSelfCrossing16() {
86+
assertThat(new Solution().isSelfCrossing(new int[] {1, 1, 2, 1, 1}), equalTo(true));
87+
}
88+
89+
@Test
90+
void isSelfCrossing17() {
91+
assertThat(new Solution().isSelfCrossing(new int[] {1, 1, 2, 2, 1, 1}), equalTo(true));
92+
}
3893
}

src/test/java/g0601_0700/s0641_design_circular_deque/MyCircularDequeTest.java

Lines changed: 71 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -19,4 +19,75 @@ void myCircularDequeTest() {
1919
assertThat(myCircularDeque.insertFront(4), equalTo(true));
2020
assertThat(myCircularDeque.getFront(), equalTo(4));
2121
}
22+
23+
@Test
24+
void myCircularDequeTest2() {
25+
MyCircularDeque deque = new MyCircularDeque(2);
26+
assertThat(deque.insertFront(10), equalTo(true));
27+
assertThat(deque.insertFront(20), equalTo(true));
28+
assertThat(deque.insertFront(30), equalTo(false)); // full
29+
assertThat(deque.getFront(), equalTo(20));
30+
assertThat(deque.deleteFront(), equalTo(true));
31+
assertThat(deque.getFront(), equalTo(10));
32+
}
33+
34+
@Test
35+
void myCircularDequeTest3() {
36+
MyCircularDeque deque = new MyCircularDeque(1);
37+
assertThat(deque.deleteFront(), equalTo(false));
38+
assertThat(deque.deleteLast(), equalTo(false));
39+
assertThat(deque.getFront(), equalTo(-1));
40+
assertThat(deque.getRear(), equalTo(-1));
41+
assertThat(deque.isEmpty(), equalTo(true));
42+
assertThat(deque.isFull(), equalTo(false));
43+
}
44+
45+
@Test
46+
void myCircularDequeTest4() {
47+
MyCircularDeque deque = new MyCircularDeque(2);
48+
assertThat(deque.insertLast(5), equalTo(true));
49+
assertThat(deque.insertFront(6), equalTo(true));
50+
assertThat(deque.isFull(), equalTo(true));
51+
assertThat(deque.insertFront(7), equalTo(false));
52+
assertThat(deque.getFront(), equalTo(6));
53+
assertThat(deque.getRear(), equalTo(5));
54+
}
55+
56+
@Test
57+
void myCircularDequeTest5() {
58+
MyCircularDeque deque = new MyCircularDeque(3);
59+
assertThat(deque.insertFront(10), equalTo(true));
60+
assertThat(deque.deleteFront(), equalTo(true));
61+
assertThat(deque.insertLast(20), equalTo(true));
62+
assertThat(deque.deleteLast(), equalTo(true));
63+
assertThat(deque.isEmpty(), equalTo(true));
64+
}
65+
66+
@Test
67+
void myCircularDequeTest6() {
68+
MyCircularDeque deque = new MyCircularDeque(1);
69+
assertThat(deque.insertFront(100), equalTo(true));
70+
assertThat(deque.isFull(), equalTo(true));
71+
assertThat(deque.getFront(), equalTo(100));
72+
assertThat(deque.getRear(), equalTo(100));
73+
assertThat(deque.deleteFront(), equalTo(true));
74+
assertThat(deque.isEmpty(), equalTo(true));
75+
}
76+
77+
@Test
78+
void myCircularDequeTest7() {
79+
MyCircularDeque deque = new MyCircularDeque(5);
80+
deque.insertFront(1);
81+
deque.insertLast(2);
82+
deque.insertFront(3);
83+
deque.insertLast(4);
84+
deque.insertFront(5);
85+
assertThat(deque.isFull(), equalTo(true));
86+
deque.deleteFront();
87+
deque.deleteLast();
88+
assertThat(deque.insertFront(6), equalTo(true));
89+
assertThat(deque.insertLast(7), equalTo(true));
90+
assertThat(deque.getFront(), equalTo(6));
91+
assertThat(deque.getRear(), equalTo(7));
92+
}
2293
}

src/test/java/g2801_2900/s2839_check_if_strings_can_be_made_equal_with_operations_i/SolutionTest.java

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,44 @@ void canBeEqual() {
1515
void canBeEqual2() {
1616
assertThat(new Solution().canBeEqual("abcd", "cdab"), equalTo(true));
1717
}
18+
19+
@Test
20+
void canBeEqual3() {
21+
assertThat(new Solution().canBeEqual("abcd", "abcd"), equalTo(true));
22+
}
23+
24+
@Test
25+
void canBeEqual4() {
26+
assertThat(new Solution().canBeEqual("abcd", "cbad"), equalTo(true));
27+
}
28+
29+
@Test
30+
void canBeEqual5() {
31+
assertThat(new Solution().canBeEqual("abcd", "adcb"), equalTo(true));
32+
}
33+
34+
@Test
35+
void canBeEqual6() {
36+
assertThat(new Solution().canBeEqual("abcd", "abdc"), equalTo(false));
37+
}
38+
39+
@Test
40+
void canBeEqual7() {
41+
assertThat(new Solution().canBeEqual("abcd", "wxyz"), equalTo(false));
42+
}
43+
44+
@Test
45+
void canBeEqual8() {
46+
assertThat(new Solution().canBeEqual("aabb", "bbaa"), equalTo(true));
47+
}
48+
49+
@Test
50+
void canBeEqual9() {
51+
assertThat(new Solution().canBeEqual("abcd", "cdab"), equalTo(true));
52+
}
53+
54+
@Test
55+
void canBeEqual10() {
56+
assertThat(new Solution().canBeEqual("abba", "baab"), equalTo(true));
57+
}
1858
}

src/test/java/g3001_3100/s3024_type_of_triangle/SolutionTest.java

Lines changed: 66 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,70 @@ void triangleType() {
1515
void triangleType2() {
1616
assertThat(new Solution().triangleType(new int[] {3, 4, 5}), equalTo("scalene"));
1717
}
18+
19+
@Test
20+
void triangleType3() {
21+
assertThat(new Solution().triangleType(new int[] {5, 5, 3}), equalTo("isosceles"));
22+
}
23+
24+
@Test
25+
void triangleType4() {
26+
assertThat(new Solution().triangleType(new int[] {1, 2, 3}), equalTo("none"));
27+
}
28+
29+
@Test
30+
void triangleType5() {
31+
assertThat(new Solution().triangleType(new int[] {100, 100, 100}), equalTo("equilateral"));
32+
}
33+
34+
@Test
35+
void triangleType6() {
36+
assertThat(new Solution().triangleType(new int[] {7, 10, 7}), equalTo("isosceles"));
37+
}
38+
39+
@Test
40+
void triangleType7() {
41+
assertThat(new Solution().triangleType(new int[] {0, 4, 4}), equalTo("none"));
42+
}
43+
44+
@Test
45+
void triangleType8() {
46+
assertThat(new Solution().triangleType(new int[] {-3, 4, 5}), equalTo("none"));
47+
}
48+
49+
@Test
50+
void triangleType9() {
51+
// 2 + 3 = 5 → equals, not greater → invalid
52+
assertThat(new Solution().triangleType(new int[] {2, 3, 5}), equalTo("none"));
53+
}
54+
55+
@Test
56+
void triangleType10() {
57+
assertThat(new Solution().triangleType(new int[] {5, 3, 4}), equalTo("scalene"));
58+
}
59+
60+
@Test
61+
void triangleType11() {
62+
assertThat(new Solution().triangleType(new int[] {4, 6, 6}), equalTo("isosceles"));
63+
}
64+
65+
@Test
66+
void triangleType12() {
67+
assertThat(new Solution().triangleType(new int[] {0, 0, 0}), equalTo("none"));
68+
}
69+
70+
@Test
71+
void triangleType13() {
72+
assertThat(new Solution().triangleType(new int[] {5, 5, 6}), equalTo("isosceles"));
73+
}
74+
75+
@Test
76+
void triangleType14() {
77+
assertThat(new Solution().triangleType(new int[] {10, 11, 12}), equalTo("scalene"));
78+
}
79+
80+
@Test
81+
void triangleType15() {
82+
assertThat(new Solution().triangleType(new int[] {1, 10, 12}), equalTo("none"));
83+
}
1884
}

src/test/java/g3101_3200/s3132_find_the_integer_added_to_array_ii/SolutionTest.java

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,4 +20,42 @@ void minimumAddedInteger2() {
2020
new Solution().minimumAddedInteger(new int[] {3, 5, 5, 3}, new int[] {7, 7}),
2121
equalTo(2));
2222
}
23+
24+
@Test
25+
void minimumAddedInteger3() {
26+
assertThat(
27+
new Solution().minimumAddedInteger(new int[] {10, 20, 30, 40}, new int[] {35, 45}),
28+
equalTo(5));
29+
}
30+
31+
@Test
32+
void minimumAddedInteger4() {
33+
assertThat(
34+
new Solution().minimumAddedInteger(new int[] {2, 5, 7, 8}, new int[] {9, 10}),
35+
equalTo(2));
36+
}
37+
38+
@Test
39+
void minimumAddedInteger5() {
40+
assertThat(
41+
new Solution().minimumAddedInteger(new int[] {2, 2, 2, 4, 4}, new int[] {6, 6, 8}),
42+
equalTo(4));
43+
}
44+
45+
@Test
46+
void minimumAddedInteger6() {
47+
assertThat(
48+
new Solution().minimumAddedInteger(new int[] {5, 5, 5, 5}, new int[] {5, 5}),
49+
equalTo(0));
50+
}
51+
52+
@Test
53+
void minimumAddedInteger7() {
54+
assertThat(
55+
new Solution()
56+
.minimumAddedInteger(
57+
new int[] {1_000_000, 2_000_000, 3_000_000, 4_000_000},
58+
new int[] {3_000_002, 4_000_002}),
59+
equalTo(2));
60+
}
2361
}

0 commit comments

Comments
 (0)