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.

思路：首先按照start sort之后，判断end是否跟start相交，如果相交，end就是两者最大值；否则加入cur；注意最后需要加入cur；

class Solution {
    public int[][] merge(int[][] intervals) {
        List<int[]> list = new ArrayList<>();
        Arrays.sort(intervals, (a, b) -> (a[0] - b[0]));
        int[] cur = intervals[0];
        for(int[] interval: intervals) {
            if(cur[1] < interval[0]) {
                list.add(cur);
                cur = interval;
            } else {
                cur[0] = Math.min(cur[0], interval[0]);
                cur[1] = Math.max(cur[1], interval[1]);
            }
        }
        list.add(cur);
        
        int[][] res = new int[list.size()][2];
        for(int i = 0; i < list.size(); i++) {
            res[i][0] = list.get(i)[0];
            res[i][1] = list.get(i)[1];
        }
        return res;
    }
}