56

sunshead · sunshead · commit 33ff20040f06 · 2020-08-02T01:55:43.000-04:00
diff --git a/Week08/problems/56_merge-intervals.java b/Week08/problems/56_merge-intervals.java
@@ -0,0 +1,24 @@
+class Solution {
+    public int[][] merge(int[][] intervals) {
+        List<int[]> res = new ArrayList<>();
+        if (intervals == null || intervals.length == 0) {
+            return new int[0][];
+        }
+        Arrays.sort(intervals, (a,b) -> a[0] - b[0]);
+        int start = intervals[0][0];
+        int end = intervals[0][1];
+        for (int[] interval : intervals) {
+            if (interval[0] <= end) {
+                end = Math.max(interval[1], end);
+            } else {
+                res.add(new int[]{start, end});
+                start = interval[0];
+                end = interval[1];
+            }
+        }
+        res.add(new int[]{start, end});
+        int[][] result = new int[res.size()][];
+        result = res.toArray(result);
+        return result;
+    }
+}
