-
Notifications
You must be signed in to change notification settings - Fork 19.9k
/
Copy pathMergeIntervalsTest.java
71 lines (61 loc) · 2.45 KB
/
MergeIntervalsTest.java
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
68
69
70
71
package com.thealgorithms.greedyalgorithms;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.Test;
public class MergeIntervalsTest {
@Test
public void testMergeIntervalsWithOverlappingIntervals() {
// Test case where some intervals overlap and should be merged
int[][] intervals = {{1, 3}, {2, 6}, {8, 10}, {15, 18}};
int[][] expected = {{1, 6}, {8, 10}, {15, 18}};
int[][] result = MergeIntervals.merge(intervals);
assertArrayEquals(expected, result);
}
@Test
public void testMergeIntervalsWithNoOverlap() {
// Test case where intervals do not overlap
int[][] intervals = {{1, 2}, {3, 4}, {5, 6}};
int[][] expected = {{1, 2}, {3, 4}, {5, 6}};
int[][] result = MergeIntervals.merge(intervals);
assertArrayEquals(expected, result);
}
@Test
public void testMergeIntervalsWithCompleteOverlap() {
// Test case where intervals completely overlap
int[][] intervals = {{1, 5}, {2, 4}, {3, 6}};
int[][] expected = {{1, 6}};
int[][] result = MergeIntervals.merge(intervals);
assertArrayEquals(expected, result);
}
@Test
public void testMergeIntervalsWithSingleInterval() {
// Test case where only one interval is given
int[][] intervals = {{1, 2}};
int[][] expected = {{1, 2}};
int[][] result = MergeIntervals.merge(intervals);
assertArrayEquals(expected, result);
}
@Test
public void testMergeIntervalsWithEmptyArray() {
// Test case where the input array is empty
int[][] intervals = {};
int[][] expected = {};
int[][] result = MergeIntervals.merge(intervals);
assertArrayEquals(expected, result);
}
@Test
public void testMergeIntervalsWithIdenticalIntervals() {
// Test case where multiple identical intervals are given
int[][] intervals = {{1, 3}, {1, 3}, {1, 3}};
int[][] expected = {{1, 3}};
int[][] result = MergeIntervals.merge(intervals);
assertArrayEquals(expected, result);
}
@Test
public void testMergeIntervalsWithRandomIntervals() {
// Test case with a mix of overlapping and non-overlapping intervals
int[][] intervals = {{1, 4}, {5, 7}, {2, 6}, {8, 10}};
int[][] expected = {{1, 7}, {8, 10}};
int[][] result = MergeIntervals.merge(intervals);
assertArrayEquals(expected, result);
}
}