Insert Interval

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

Java代码：

/** * 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> insert(List<Interval> intervals, Interval newInterval) {        if(intervals.isEmpty()){            intervals.add(newInterval);            return intervals;        }        int start = newInterval.start;        int end = newInterval.end;        ListIterator<Interval> li = intervals.listIterator();        boolean inserted = false;        while(li.hasNext()){            Interval itv = li.next();            if(start <= itv.end){                if(end < itv.start){ //newInterval does not overlap with current itv, time to insert                    li.remove();                    li.add(new Interval(start, end));                    li.add(itv);                    inserted = true;                    break;                }                // still some overlap so compare start & end                start = Math.min(start, itv.start);                end = Math.max(end, itv.end);                li.remove();            }        }        if(!inserted){            intervals.add(new Interval(start, end));        }        return intervals;    }}