Update Remove Interval.java

varunu28 · web-flow · commit 93ab03af6feb · 2024-02-15T08:18:50.000-08:00
diff --git a/Medium/Remove Interval.java b/Medium/Remove Interval.java
@@ -1,18 +1,37 @@
 class Solution {
-  public List<List<Integer>> removeInterval(int[][] intervals, int[] toBeRemoved) {
-    List<List<Integer>> result = new ArrayList<>();
-    for (int[] interval : intervals) {
-      if (interval[0] > toBeRemoved[1] || interval[1] < toBeRemoved[0]) {
-        result.add(Arrays.asList(interval[0], interval[1]));
-      } else {
-        if (interval[0] < toBeRemoved[0]) {
-          result.add(Arrays.asList(interval[0], toBeRemoved[0]));
+    public List<List<Integer>> removeInterval(int[][] intervals, int[] toBeRemoved) {
+        List<List<Integer>> result = new ArrayList<>();
+        int n = intervals.length;
+        int removeStart = toBeRemoved[0];
+        int removeEnd = toBeRemoved[1];
+        for (int i = 0; i < n; i++) {
+            int currStart = intervals[i][0];
+            int currEnd = intervals[i][1];
+            // complete overlap hence skipping complete interval
+            if (currStart >= removeStart && currEnd <= removeEnd) {
+                continue;
+            }
+            // no overlap hence adding complete interval
+            if ((currStart <= removeStart && currEnd <= removeStart) || (currStart >= removeEnd && currEnd >= removeEnd)) {
+                result.add(List.of(currStart, currEnd));
+                continue;
+            } 
+            // partial overlaps
+            if (currStart <= removeStart) {
+                int newStart = Math.min(currStart, removeStart);
+                int newEnd = Math.max(currStart, removeStart);
+                if (newStart != newEnd) {
+                    result.add(List.of(newStart, newEnd));
+                }
+            }
+            if (currEnd >= removeEnd) {
+                int newStart = Math.min(currEnd, removeEnd);
+                int newEnd = Math.max(currEnd, removeEnd);
+                if (newStart != newEnd) {
+                    result.add(List.of(newStart, newEnd));
+                }
+            }
         }
-        if (interval[1] > toBeRemoved[1]) {
-          result.add(Arrays.asList(toBeRemoved[1], interval[1]));
-        }
-      }
+        return result;
     }
-    return result;
-  } 
 }
