Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public int[][] intervalIntersection(int[][] A, int[][] B) {
- ArrayList<int[]> res = new ArrayList<int[]>();
- int i=0,j=0,k = 0;
- while(i<A.length && j<B.length){
- int x1 = A[i][0];
- int y1 = A[i][1];
- int x2 = B[j][0];
- int y2 = B[j][1];
- int x = Math.max(x1,x2);
- int y = Math.min(y1,y2);
- if(x<=y){
- // op[k] = new int[] {x,y};
- // k++;
- res.add(new int[] {x,y});
- }
- if(A[i][1]<B[j][1]){
- i++;
- }else{
- j++;
- }
- }
- int[][] op = new int[res.size()][2];
- op = res.toArray(op);
- return op;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement