|
| 1 | +package com.fishercoder.solutions; |
| 2 | + |
| 3 | +import java.util.ArrayList; |
| 4 | +import java.util.List; |
| 5 | + |
| 6 | +/** |
| 7 | + * 986. Interval List Intersections |
| 8 | + * |
| 9 | + * Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order. |
| 10 | + * Return the intersection of these two interval lists. |
| 11 | + * |
| 12 | + * (Formally, a closed interval [a, b] (with a <= b) denotes the set of real numbers x with a <= x <= b. |
| 13 | + * The intersection of two closed intervals is a set of real numbers that is either empty, or can be represented as a closed interval. |
| 14 | + * For example, the intersection of [1, 3] and [2, 4] is [2, 3].) |
| 15 | + * |
| 16 | + * Example 1: |
| 17 | + * Input: A = [[0,2],[5,10],[13,23],[24,25]], B = [[1,5],[8,12],[15,24],[25,26]] |
| 18 | + * Output: [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]] |
| 19 | + * Reminder: The inputs and the desired output are lists of Interval objects, and not arrays or lists. |
| 20 | + * |
| 21 | + * Note: |
| 22 | + * 0 <= A.length < 1000 |
| 23 | + * 0 <= B.length < 1000 |
| 24 | + * 0 <= A[i].start, A[i].end, B[i].start, B[i].end < 10^9 |
| 25 | + * NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature. |
| 26 | + * */ |
| 27 | +public class _986 { |
| 28 | + public static class Solution1 { |
| 29 | + public int[][] intervalIntersection(int[][] A, int[][] B) { |
| 30 | + int i = 0; |
| 31 | + int j = 0; |
| 32 | + List<int[]> list = new ArrayList<>(); |
| 33 | + while (i < A.length && j < B.length) { |
| 34 | + int start = Math.max(A[i][0], B[j][0]); |
| 35 | + int end = Math.min(A[i][1], B[j][1]); |
| 36 | + if (start <= end) { |
| 37 | + list.add(new int[]{start, end}); |
| 38 | + } |
| 39 | + if (end == A[i][1]) { |
| 40 | + i++; |
| 41 | + } else { |
| 42 | + j++; |
| 43 | + } |
| 44 | + } |
| 45 | + int[][] result = new int[list.size()][2]; |
| 46 | + for (int k = 0; k < list.size(); k++) { |
| 47 | + result[k] = list.get(k); |
| 48 | + } |
| 49 | + return result; |
| 50 | + } |
| 51 | + } |
| 52 | +} |
0 commit comments