Updated Merge Intervals.java

varunu28 · varunu28 · commit 97c6f39986ba · 2023-06-08T14:37:39.000-07:00
diff --git a/Medium/Merge Intervals.java b/Medium/Merge Intervals.java
@@ -1,22 +1,18 @@
 class Solution {
-  public int[][] merge(int[][] intervals) {
-    Arrays.sort(intervals, Comparator.comparingInt((int[] o) -> o[0]).thenComparingInt(o -> o[1]));
-    List<int[]> mergedIntervals = new ArrayList<>();
-    int idx = 0;
-    while (idx < intervals.length) {
-      int currentStart = intervals[idx][0];
-      int currentEnd = intervals[idx][1];
-      idx++;
-      while (idx < intervals.length && intervals[idx][0] <= currentEnd) {
-        currentEnd = Math.max(intervals[idx][1], currentEnd);
-        idx++;
-      }
-      mergedIntervals.add(new int[]{currentStart, currentEnd});
+    public int[][] merge(int[][] intervals) {
+        Arrays.sort(intervals, Comparator.comparingInt((int[] o) -> o[0])
+                .thenComparingInt(o -> o[1]));
+        int idx = 0;
+        List<int[]> result = new ArrayList<>();
+        while (idx < intervals.length) {
+            int start = intervals[idx][0];
+            int end = intervals[idx][1];
+            idx++;
+            while (idx < intervals.length && intervals[idx][0] <= end) {
+                end = Math.max(end, intervals[idx++][1]);
+            }
+            result.add(new int[]{start, end});
+        }
+        return result.toArray(new int[][]{});
     }
-    int[][] result = new int[mergedIntervals.size()][2];
-    for (int i = 0; i < mergedIntervals.size(); i++) {
-      result[i] = mergedIntervals.get(i);
-    }
-    return result;
-  }
 }
