leetcode 986. 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.

Note:

1. 0 <= A.length < 1000
2. 0 <= B.length < 1000
3. 0 <= A[i].start, A[i].end, B[i].start, B[i].end < 10^9

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

 

思路：

双指针法，思路同https://blog.csdn.net/orangefly0214/article/details/92798308中的双指针，我们需要用两个指针逐个将两个数组中的每个元素都进行比较。

1. 判断子数组的交集时：start取两者中的较大值，end取两者中的较小值，在对两个子数组求交集时，如果start>end,则说明这两个子数组没有交集。

2.指针移动的判断：我们以子数组的end边为界，对子数组求完交集后，我们把end较小的那个子数组的指针后移一位，接着和另一个子数组求交集。

3.如果A的pair对有m个，B 的pair对有n个，那么我们在求交集时，总共需要做m*n次比较（数组A和数组B中的每个元素两两之间都需要进行求交集的比较。）

实现：

//利用双指针
    public int[][] intervalIntersection(int[][] A, int[][] B) {
        ArrayList<int[]> ret=new ArrayList<>();
        int i=0,j=0;//两个指针，分别指向A，B
        while(i<A.length&&j<B.length){
            int start=Math.max(A[i][0],B[j][0]);
            int end=Math.min(A[i][1],B[j][1]);
            if(start<=end){
                ret.add(new int[]{start,end});
            }
            if(A[i][1]>B[j][1]){
                j++;
            }else {
                i++;
            }
        }
        int[][] res=new int[ret.size()][2];
        int k=0;
        for(int[] pair:ret){
            res[k++]=pair;
        }
        return  res;
    }