Fix clang format errors

Author: Hardvan

src/main/java/com/thealgorithms/greedyalgorithms/MergeIntervals.java

@@ -29,7 +29,7 @@ private MergeIntervals() {
      * merged interval,
      * it updates the end time of the last merged interval. Otherwise, it adds the
      * interval as a new entry.
-     * 
+     *
      * @param intervals A 2D array representing intervals where each element is an
      *                  interval [starti, endi].
      * @return A 2D array of merged intervals where no intervals overlap.

src/test/java/com/thealgorithms/greedyalgorithms/MergeIntervalsTest.java

@@ -9,35 +9,35 @@ 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[][] 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[][] 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[][] 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[][] intervals = {{1, 2}};
+        int[][] expected = {{1, 2}};
         int[][] result = MergeIntervals.merge(intervals);
         assertArrayEquals(expected, result);
     }
@@ -54,18 +54,18 @@ public void testMergeIntervalsWithEmptyArray() {
     @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[][] 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, 6 }, { 5, 7 }, { 8, 10 } };
+        int[][] intervals = {{1, 4}, {5, 7}, {2, 6}, {8, 10}};
+        int[][] expected = {{1, 6}, {5, 7}, {8, 10}};
         int[][] result = MergeIntervals.merge(intervals);
         assertArrayEquals(expected, result);
     }
-}
+}