-
Notifications
You must be signed in to change notification settings - Fork 21.2k
Expand file tree
/
Copy pathRobotsCollisionTest.java
More file actions
67 lines (59 loc) · 2.32 KB
/
RobotsCollisionTest.java
File metadata and controls
67 lines (59 loc) · 2.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package com.thealgorithms.greedyalgorithms;
import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.params.ParameterizedTest;
import org.junit.jupiter.params.provider.CsvSource;
class RobotsCollisionTest {
// basic example — two pairs colliding, find the earliest
@Test
void testBasicCollision() {
int[] positions = {3, 5, 8, 10};
String directions = "RLRL";
assertEquals(1, RobotsCollision.earliestCollisionTime(4, positions, directions));
}
// no collision at all — all moving in same direction
@Test
void testNoCollision() {
int[] positions = {1, 3, 5, 7};
String directions = "RRRR";
assertEquals(-1, RobotsCollision.earliestCollisionTime(4, positions, directions));
}
// all moving left — no one to crash into
@Test
void testAllMovingLeft() {
int[] positions = {2, 5, 8};
String directions = "LLL";
assertEquals(-1, RobotsCollision.earliestCollisionTime(3, positions, directions));
}
// just two robots heading toward each other
@Test
void testTwoRobotsCollide() {
int[] positions = {1, 5};
String directions = "RL";
// gap is 4, time = 4/2 = 2
assertEquals(2, RobotsCollision.earliestCollisionTime(2, positions, directions));
}
// only one robot — can't collide with anyone
@Test
void testSingleRobot() {
int[] positions = {4};
String directions = "R";
assertEquals(-1, RobotsCollision.earliestCollisionTime(1, positions, directions));
}
// multiple cases in one shot using parameterized test
@ParameterizedTest
@CsvSource({
"2, '1,3', 'RL', 1", // gap of 2 → time 1
"2, '0,10', 'RL', 5", // gap of 10 → time 5
"2, '5,5', 'RL', 0" // same spot → already colliding
})
void testVariousCollisionTimes(int n, String posStr, String directions, int expected) {
// parse the position string into an int array
String[] parts = posStr.split(",");
int[] positions = new int[parts.length];
for (int i = 0; i < parts.length; i++) {
positions[i] = Integer.parseInt(parts[i].trim());
}
assertEquals(expected, RobotsCollision.earliestCollisionTime(n, positions, directions));
}
}