【LeetCode】-Insert Interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].

Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].

This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].

/**
 * 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 class MyComparator implements Comparator<Interval>{

		@Override
		public int compare(Interval arg0, Interval arg1) {
			// TODO Auto-generated method stub
			if( arg0.start==arg1.start )
				return 0;
			return arg0.start<arg1.start? -1:1;
		}
		
	}
	public List<Interval> merge(List<Interval> intervals) {
		if( intervals==null )
			return null;
		Collections.sort( intervals, new MyComparator());
		List<Interval> list = new ArrayList<Interval>();
		Iterator<Interval> itr = intervals.iterator();
		while( itr.hasNext() ){
			Interval interval1 = itr.next();
			if(list.isEmpty()){
				list.add( interval1 );
			}else{
				Interval interval2 = list.get( list.size()-1 );
				if( interval2.end<interval1.start ){
					list.add( interval1 );
				}else if( interval2.end<=interval1.end ){
					interval2.end = interval1.end;
				}
			}
		}
		return list;
	}
	
    public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
        intervals.add(newInterval);
		return merge(intervals);   
    }
}