Day 23 Solution

Author: vamsikrish53

May LeetCoding Challenge/Day_ 23/Solution.java

@@ -0,0 +1,26 @@
+// https://leetcode.com/problems/interval-list-intersections/
+
+class Solution {
+ public int[][] intervalIntersection(int[][] A, int[][] B) {
+ List<int[]> ans = new ArrayList();
+ int i = 0, j = 0;
+
+ while (i < A.length && j < B.length) {
+ // Let's check if A[i] intersects B[j].
+ // lo - the startpoint of the intersection
+ // hi - the endpoint of the intersection
+ int lo = Math.max(A[i][0], B[j][0]);
+ int hi = Math.min(A[i][1], B[j][1]);
+ if (lo <= hi)
+ ans.add(new int[]{lo, hi});
+
+ // Remove the interval with the smallest endpoint
+ if (A[i][1] < B[j][1])
+ i++;
+ else
+ j++;
+ }
+
+ return ans.toArray(new int[ans.size()][]);
+ }
+}