Runtime: 6 ms (Top 9.49%) | Memory: 45.30 MB (Top 8.74%)

Author: AnasImloul

scripts/algorithms/I/Interval List Intersections/Interval List Intersections.java

@@ -1,30 +1,23 @@
+// Runtime: 6 ms (Top 9.49%) | Memory: 45.30 MB (Top 8.74%)
+
 class Solution {
-    public int[][] intervalIntersection(int[][] firstList, int[][] secondList) {
-        int i = 0;
-        int j = 0;
-        
+    public int[][] intervalIntersection(int[][] A, int[][] B) {
         List<int[]> ans = new ArrayList<>();
-        
-        while(i<firstList.length && j<secondList.length){
-            int a[] = firstList[i];
-            int b[] = secondList[j];
-            
-            if(b[0]<=a[1] && b[0]>=a[0])
-                ans.add(new int[]{b[0], Math.min(a[1], b[1])});
-            else if(a[0]<=b[1] && a[0]>=b[0])
-                ans.add(new int[]{a[0], Math.min(a[1], b[1])});
-            
-            if(a[1]<=b[1])
-                i++;
-            else
-                j++;
+        int i = 0, j = 0;
+        while(i < A.length && j< B.length){
+            int start = Math.max(A[i][0], B[j][0]);
+            int end = Math.min(A[i][1], B[j][1]);
+            if(start <= end) ans.add(new int[]{start, end});
+            if(A[i][1]>B[j][1]) j++;
+            else i++;
         }
 
-        int res[][] = new int[ans.size()][2];
-        
-        for(i=0;i<ans.size();i++){
-            res[i] = ans.get(i);
+        int[][] res = new int[ans.size()][2];
+        i = 0;
+        for(int[] pair: ans){
+            res[i++] = pair;
         }
+        
         return res;
     }
 }