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 considerred overlapping.

复用一下Insert Intervals的解法即可，创建一个新的interval集合，然后每次从旧的里面取一个interval出来，然后插入到新的集合中. 

使用Comparator比较每个interval之间的关系. 合并延长或者删除.

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
class Solution {
    public List<Interval> merge(List<Interval> intervals) {
        Collections.sort(intervals, (o1, o2) -> {
                return o1.start - o2.start;
        });
        
        List<Interval> res = new ArrayList<>();
        Interval prev = null;
        
        for (Interval curr : intervals) {
            if (prev == null || curr.start > prev.end) {
                res.add(curr);
                prev = curr;
            } else if (curr.end > prev.end) {
                prev.end = curr.end;
            }
        }
        return res;
    }
}