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

Commitb3273d7

Browse files
authored
Added tests for tasks 33-1036
1 parented492ec commitb3273d7

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
voidsearch3() {
2121
assertThat(newSolution().search(newint[] {1},0),equalTo(-1));
2222
}
23+
24+
@Test
25+
voidsearch4() {
26+
assertThat(newSolution().search(newint[] {1,2,3,4,5,6},4),equalTo(3));
27+
}
28+
29+
@Test
30+
voidsearch5() {
31+
assertThat(newSolution().search(newint[] {1,2,3,4,5,6},10),equalTo(-1));
32+
}
33+
34+
@Test
35+
voidsearch6() {
36+
assertThat(newSolution().search(newint[] {6,7,0,1,2,3,4},7),equalTo(1));
37+
}
38+
39+
@Test
40+
voidsearch7() {
41+
assertThat(newSolution().search(newint[] {6,7,0,1,2,3,4},3),equalTo(5));
42+
}
43+
44+
@Test
45+
voidsearch8() {
46+
assertThat(newSolution().search(newint[] {5,1},1),equalTo(1));
47+
}
48+
49+
@Test
50+
voidsearch9() {
51+
assertThat(newSolution().search(newint[] {5,1},2),equalTo(-1));
52+
}
53+
54+
@Test
55+
voidsearch10() {
56+
assertThat(newSolution().search(newint[] {4,5,6,7,0,1,2},4),equalTo(0));
57+
}
58+
59+
@Test
60+
voidsearch11() {
61+
assertThat(newSolution().search(newint[] {4,5,6,7,0,1,2},2),equalTo(6));
62+
}
63+
64+
@Test
65+
voidsearch12() {
66+
assertThat(newSolution().search(newint[] {2,3,4,5,6,0,1},0),equalTo(5));
67+
}
68+
69+
@Test
70+
voidsearch13() {
71+
assertThat(newSolution().search(newint[] {0,1,2,3,4,5},3),equalTo(3));
72+
}
73+
74+
@Test
75+
voidsearch14() {
76+
assertThat(newSolution().search(newint[] {5,6,7,0,1,2,3},2),equalTo(5));
77+
}
78+
79+
@Test
80+
voidsearch15() {
81+
assertThat(newSolution().search(newint[] {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+
voidmyCircularQueue2() {
25+
MyCircularQueueq =newMyCircularQueue(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+
voidmyCircularQueue3() {
39+
MyCircularQueueq =newMyCircularQueue(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+
voidmyCircularQueue4() {
48+
MyCircularQueueq =newMyCircularQueue(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+
voidmyCircularQueue5() {
61+
MyCircularQueueq =newMyCircularQueue(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+
voidmyCircularQueue6() {
82+
MyCircularQueueq =newMyCircularQueue(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
voidmovesToChessboard3() {
2727
assertThat(newSolution().movesToChessboard(newint[][] {{1,0}, {1,0}}),equalTo(-1));
2828
}
29+
30+
@Test
31+
voidmovesToChessboard4() {
32+
assertThat(
33+
newSolution()
34+
.movesToChessboard(
35+
newint[][] {
36+
{0,0},
37+
{0,1}
38+
}),
39+
equalTo(-1));
40+
}
41+
42+
@Test
43+
voidmovesToChessboard5() {
44+
assertThat(
45+
newSolution()
46+
.movesToChessboard(
47+
newint[][] {
48+
{1,1},
49+
{1,1}
50+
}),
51+
equalTo(-1));
52+
}
53+
54+
@Test
55+
voidmovesToChessboard6() {
56+
assertThat(
57+
newSolution()
58+
.movesToChessboard(
59+
newint[][] {
60+
{1,0},
61+
{1,0}
62+
}),
63+
equalTo(-1));
64+
}
65+
66+
@Test
67+
voidmovesToChessboard7() {
68+
assertThat(
69+
newSolution()
70+
.movesToChessboard(
71+
newint[][] {
72+
{1,0,1},
73+
{0,1,0},
74+
{1,0,1}
75+
}),
76+
equalTo(0));
77+
}
78+
79+
@Test
80+
voidmovesToChessboard8() {
81+
assertThat(
82+
newSolution()
83+
.movesToChessboard(
84+
newint[][] {
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+
voidmovesToChessboard9() {
95+
assertThat(newSolution().movesToChessboard(newint[][] {{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
voidisRationalEqual3() {
2121
assertThat(newSolution().isRationalEqual("0.9(9)","1."),equalTo(true));
2222
}
23+
24+
@Test
25+
voidisRationalEqual4() {
26+
assertThat(newSolution().isRationalEqual("3.14","3.14"),equalTo(true));
27+
}
28+
29+
@Test
30+
voidisRationalEqual5() {
31+
assertThat(newSolution().isRationalEqual("3.14","3.15"),equalTo(false));
32+
}
33+
34+
@Test
35+
voidisRationalEqual6() {
36+
// 0.(3) = 0.3333...
37+
assertThat(newSolution().isRationalEqual("0.(3)","0.3333333333"),equalTo(false));
38+
}
39+
40+
@Test
41+
voidisRationalEqual7() {
42+
assertThat(newSolution().isRationalEqual("0.(12)","0.(13)"),equalTo(false));
43+
}
44+
45+
@Test
46+
voidisRationalEqual8() {
47+
// 1.(0) = 1.00000....
48+
assertThat(newSolution().isRationalEqual("1.(0)","1."),equalTo(true));
49+
}
50+
51+
@Test
52+
voidisRationalEqual9() {
53+
// large repeating cycle
54+
assertThat(newSolution().isRationalEqual("0.(987654321)","0.(987654321)"),equalTo(true));
55+
}
56+
57+
@Test
58+
voidisRationalEqual10() {
59+
assertThat(newSolution().isRationalEqual("42","42"),equalTo(true));
60+
}
61+
62+
@Test
63+
voidisRationalEqual11() {
64+
assertThat(newSolution().isRationalEqual("42","42.0"),equalTo(true));
65+
}
66+
67+
@Test
68+
voidisRationalEqual12() {
69+
assertThat(newSolution().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
newint[][] {},newint[] {0,0},newint[] {999999,999999}),
2424
equalTo(true));
2525
}
26+
27+
@Test
28+
voidisEscapePossible3() {
29+
assertThat(
30+
newSolution()
31+
.isEscapePossible(newint[][] {{1,1}},newint[] {0,0},newint[] {1,1}),
32+
equalTo(true));
33+
}
34+
35+
@Test
36+
voidisEscapePossible4() {
37+
assertThat(
38+
newSolution()
39+
.isEscapePossible(
40+
newint[][] {{10,10}},newint[] {0,0},newint[] {0,1}),
41+
equalTo(true));
42+
}
43+
44+
@Test
45+
voidisEscapePossible5() {
46+
assertThat(
47+
newSolution()
48+
.isEscapePossible(
49+
newint[][] {{0,2}, {1,2}, {2,2}},
50+
newint[] {0,0},
51+
newint[] {3,3}),
52+
equalTo(true));
53+
}
54+
55+
@Test
56+
voidisEscapePossible6() {
57+
assertThat(
58+
newSolution()
59+
.isEscapePossible(
60+
newint[][] {{0,1}, {0,2}, {1,0}, {2,0}},
61+
newint[] {0,0},
62+
newint[] {3,3}),
63+
equalTo(false));
64+
}
65+
66+
@Test
67+
voidisEscapePossible7() {
68+
assertThat(
69+
newSolution()
70+
.isEscapePossible(
71+
newint[][] {{999998,999999}, {999999,999998}},
72+
newint[] {999999,999999},
73+
newint[] {0,0}),
74+
equalTo(false));
75+
}
76+
77+
@Test
78+
voidisEscapePossible8() {
79+
assertThat(
80+
newSolution()
81+
.isEscapePossible(
82+
newint[][] {{5,5}, {5,6}, {6,5}},
83+
newint[] {5,7},
84+
newint[] {6,6}),
85+
equalTo(true));
86+
}
87+
88+
@Test
89+
voidisEscapePossible9() {
90+
assertThat(
91+
newSolution()
92+
.isEscapePossible(newint[][] {{1,2}},newint[] {2,2},newint[] {2,2}),
93+
equalTo(true));
94+
}
95+
96+
@Test
97+
voidisEscapePossible10() {
98+
assertThat(
99+
newSolution().isEscapePossible(newint[][] {},newint[] {0,0},newint[] {0,1}),
100+
equalTo(true));
101+
}
102+
103+
@Test
104+
voidisEscapePossible11() {
105+
assertThat(
106+
newSolution()
107+
.isEscapePossible(newint[][] {{2,2}},newint[] {2,1},newint[] {2,2}),
108+
equalTo(true));
109+
}
26110
}

0 commit comments

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