【区间合并】Merge Intervals

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

解法：先排序区间，再遍历比较后一个的start是否小于等于遍历的end

/**
 * 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; }
 * }
 */
public class Solution {
    public ArrayList<Interval> merge(ArrayList<Interval> intervals) {
        ArrayList<Interval> res = new ArrayList<Interval>();
        Interval cur = null;
        int len = intervals.size();
        
        Collections.sort(intervals, new IntervalComparator());
        
        for(int i=0; i<len; i++){
            if(cur == null) cur = intervals.get(i);
            if(i+1 == len){
                res.add(cur);
            }
            else{
                Interval next = intervals.get(i+1);
                if(next.start <= cur.end){
                    cur.end = Math.max(cur.end, next.end);
                }
                else{
                    res.add(cur);
                    cur = null;
                }
            }
        }
        return res;
    }
}

class IntervalComparator implements Comparator<Interval>
{
    public int compare(Interval a, Interval b) {
        return a.start - b.start;
    }
}