Skip to content

Commit c31404d

Browse files
committed
interval intersection using 2 pointers
1 parent 36fb537 commit c31404d

File tree

1 file changed

+28
-0
lines changed

1 file changed

+28
-0
lines changed
Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
class Solution {
2+
public int[][] intervalIntersection(int[][] A, int[][] B) {
3+
if (A == null || A.length == 0 || B == null || B.length == 0) {
4+
return new int[][]{};
5+
}
6+
int a = 0;
7+
int b = 0;
8+
List<int[]> res = new ArrayList<>();
9+
int i=0;
10+
while(a < A.length && b < B.length) {
11+
12+
int start = Math.max(A[a][0], B[b][0]);
13+
int end = Math.min(A[a][1], B[b][1]);
14+
if (end >= start) {
15+
res.add(new int[]{start, end});
16+
}
17+
18+
if (A[a][1] == end) {
19+
a++;
20+
}
21+
22+
if (B[b][1] == end) {
23+
b++;
24+
}
25+
}
26+
return res.toArray(new int[res.size()][2]);
27+
}
28+
}

0 commit comments

Comments
 (0)