algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 06:23:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add Merge Intervals algorithm (#5516)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-03 12:37:44 +05:30
committed by GitHub
parent ea0ed23961
commit ce6d98f8da
3 changed files with 143 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

71
src/test/java/com/thealgorithms/greedyalgorithms/MergeIntervalsTest.java Normal file
View File

@ -0,0 +1,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);
}
}