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

题目和Merge Interval的区别是intervals是排序过的。可以将带插入的newInterval分为

三种情况：

public class Solution {
    public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
        ArrayList<Interval> result=new ArrayList<Interval>();
		for(Interval cur:intervals){
			if(cur.end<newInterval.start){
				result.add(cur);
			}else if(cur.start>newInterval.end){
				result.add(newInterval);
				newInterval=cur;
			}else
				newInterval=new Interval(Math.min(cur.start,newInterval.start),
						Math.max(cur.end,newInterval.end));
		}
		result.add(newInterval);
		return result;
    }
}