56. Merge Intervals

public List<Interval> merge(List<Interval> intervals) {
    if (intervals. size () <= 1 )
        return intervals;
   
    // Sort by ascending starting point using an anonymous Comparator
    intervals.sort((i1, i2) -> Integer.compare(i1.start, i2.start));
   
    List<Interval> result = new LinkedList<Interval>();
    int start = intervals. get ( 0 ).start;
    int end = intervals. get ( 0 ). end ;
   
    for (Interval interval : intervals) {
        if (interval.start <= end ) // Overlapping intervals, move the end if needed
            end = Math. max ( end , interval. end );
        else {                     // Disjoint intervals, add the previous one and reset bounds
            result.add( new Interval(start, end ));
            start = interval.start;
            end = interval. end ;
        }
    }
   
    // Add the last interval
    result.add( new Interval(start, end ));
    return result;
}