LeetCode 56. Merge Intervals

Given a collection of intervals, merge all overlapping intervals.

Example 1:

Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].

Example 2:

Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.

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

要求合并区间,思路如下：

先将所有interval按照起点位置排序

然后依次考虑每个interval能否和上一个interval合并

class Solution {
    public int[][] merge(int[][] intervals) {
        
        if(intervals.length<=1) return intervals;
        
        ArrayList<int[]> res = new ArrayList<>();
        //将所有区间按照start位置从小到大进行排序 O(nlgn)
        Arrays.sort(intervals, (int[] interval_1, int[] interval_2) -> interval_1[0]-interval_2[0]);
        
        int[] prev_interval = new int[]{intervals[0][0],intervals[0][1]};//上一个区间
        for(int i = 1;i<intervals.length;i++){//i从1开始
            int[] interval = intervals[i];//当前区间
            if(prev_interval[1]>=interval[0]){//当前interval和前一个interval重叠：需要合并
                prev_interval[1] = Math.max(prev_interval[1],interval[1]);//合并后的的区间将要成为 新的previous interval
            }
            else{//当前interval和前一个interval不重叠，那么上一个interval就可以放入array中了
                res.add(new int[]{prev_interval[0],prev_interval[1]});
                
                //当前interval 将要变成 previous interval
                prev_interval[0] = interval[0];
                prev_interval[1] = interval[1];
            }
        }
        
        //对于最后一个interval，
        //如果它与prev不重叠，那么prev被放入res,然后prev的值变为最后一个interval的值。然而最后一个interval并没有放入res
        //如果它与prev重叠，那么prev更新为合并后的interval，然而这个interval并没有放入res
        //所以，我们最后要将prev放入res
        res.add(new int[]{prev_interval[0],prev_interval[1]});
        
        //arraylist转为二维数组
        int[][] result = new int[res.size()][2];
        for(int i = 0;i<result.length;i++){
            result[i] = res.get(i);
        }
        return result;
    }
}