Create 56-Merge-Intervals.java

SharmaTushar1 · web-flow · commit cf2f73b5e47a · 2022-07-06T22:26:15.000+05:30
diff --git a/java/56-Merge-Intervals.java b/java/56-Merge-Intervals.java
@@ -0,0 +1,21 @@
+class Solution {
+    public int[][] merge(int[][] intervals) {
+        ArrayList<int[]> ans = new ArrayList<>();
+        Arrays.sort(intervals, (a,b) -> Integer.compare(a[0], b[0]));
+        ans.add(intervals[0]);
+        for (int i = 1; i<intervals.length; i++) {
+            int prevStart = ans.get(ans.size()-1)[0];
+            //comparing the values of prevEnd and curEnd
+            int curStart = intervals[i][0];
+            if (curStart<=ans.get(ans.size()-1)[1]) {
+                //do the merging
+                ans.get(ans.size()-1)[1] = Math.max(ans.get(ans.size()-1)[1], intervals[i][1]);
+            } else {
+                ans.add(intervals[i]);
+            }
+        }
+        int[][] res = new int[ans.size()][2];
+        ans.toArray(res);
+        return res;
+    }
+}
