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

思路: 首先从头开始找到当前元素待插入地方,然后再从尾找到当前元素应该插入的地方,然后更新元素值,然后删除中间的元素.

时间复杂度:O(N)

<span style="font-size:14px;">/**
 * 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) {
        int n=intervals.size();
        int i=n-1;
        while(i>=0&&newInterval.end<intervals.get(i).start)
            i--;
        
        
        int j=0;
        while(j<n&&newInterval.start>intervals.get(j).end)
            j++;
        
        if(j>i){
            intervals.add(j,newInterval);
            return intervals;
        }
        intervals.get(j).start=intervals.get(j).start<newInterval.start?intervals.get(j).start:newInterval.start;
        intervals.get(j).end=intervals.get(i).end>newInterval.end?intervals.get(i).end:newInterval.end;
        
        for(;j<i;i--)
            intervals.remove(i);
            
        
        return intervals;
        
    }
}</span>