Leetcode#56||Merger Intervals

/**
 * 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) {
        List<Interval> result = new ArrayList<Interval>();
    
        if (intervals == null || intervals.size() == 0) {
            return result;
        }
        
        Collections.sort(intervals, new IntervalComparator());
        
        Interval left = intervals.get(0);
        
        for (int i = 1; i < intervals.size(); i++) {
            Interval right = intervals.get(i);
            
            if (left.end < right.start) {
                result.add(left);
                left = right;
            } else {
                Interval temp = new Interval(left.start, Math.max(left.end, right.end));
                left = temp;
            }
        }
        
        result.add(left);
        
        return result;
    }
}

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