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].

Have you been asked this question in an interview?  Yes

要注意各种corner case，同时可以看到，用一个 Math.max() 方法，可以代替 一个if 语句块

/**
 * 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 List<Interval> merge(List<Interval> intervals) {
        if (intervals == null || intervals.size() <= 1) {
            return intervals;
        }
        List<Interval> res = new ArrayList<Interval>();
        Collections.sort(intervals, new IntervalComparator());
        res.add(new Interval(intervals.get(0).start, intervals.get(0).end));
        for (int i = 1; i < intervals.size(); i++) {
            //[[0,0],[1,4]], [[1,4],[1,4]];[[1,4],[0,0]]
            if (intervals.get(i).start <= res.get(res.size() - 1).end) {
               // if (intervals.get(i).end >= res.get(res.size() - 1).end) {
                //    res.get(res.size() - 1).end = intervals.get(i).end;
                //}
                res.get(res.size() - 1).end = Math.max(intervals.get(i).end,res.get(res.size() - 1).end);
            } else {
                res.add(new Interval(intervals.get(i).start, intervals.get(i).end));
            }
        }
        return res;
    }
    public class IntervalComparator implements Comparator<Interval> {
         public int compare(Interval a, Interval b) {
            return a.start - b.start;
        }
    }
}