Interval List Intersections

Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order.

Return the intersection of these two interval lists.

(Formally, a closed interval [a, b] (with a <= b) denotes the set of real numbers x with a <= x <= b.  The intersection of two closed intervals is a set of real numbers that is either empty, or can be represented as a closed interval.  For example, the intersection of [1, 3] and [2, 4] is [2, 3].)

Example 1:

Input: A = [[0,2],[5,10],[13,23],[24,25]], B = [[1,5],[8,12],[15,24],[25,26]]
Output: [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
Reminder: The inputs and the desired output are lists of Interval objects, and not arrays or lists.

思路：跟Time Intersection一样，因为是有序的，可以直接打擂台的方式，扫描，start取最大值，end取最小值，如果start <= end就加入 res。否则，淘汰掉end在前面的那个interval；

class Solution {
    public int[][] intervalIntersection(int[][] firstList, int[][] secondList) {
        int a = 0; int b = 0;
        List<int[]> list = new ArrayList<>();
        while(a < firstList.length && b < secondList.length) {
            int start = Math.max(firstList[a][0], secondList[b][0]);
            int end = Math.min(firstList[a][1], secondList[b][1]);
            if(start <= end) {
                list.add(new int[] {start, end});
            }
            if(firstList[a][1] < secondList[b][1]) {
                a++;
            } else {
                b++;
            }
        }
        int[][] res = new int[list.size()][2];
        for(int i = 0; i < res.length; i++) {
            res[i][0] = list.get(i)[0];
            res[i][1] = list.get(i)[1];
        }
        return res;
    }
}