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

这道题的难道主要在于各种Corner Case，我也是写了改了很久才写出来。

/**
 * 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 start = newInterval.start;
        int end = newInterval.end;
        List<Interval> list = new LinkedList<>();
        
        if(intervals.size() <1 ) {
             list.add(newInterval);
             return list;
        }
        int i = 0;
        for(; i<intervals.size(); i++){
            if(start <= intervals.get(i).end) break;
            list.add(intervals.get(i));
        }
        if(i == intervals.size()){
            list.add(newInterval);
            return list;
        }
        start = Math.min(intervals.get(i).start, start);
        for(;i<intervals.size();i++){
            if(end < intervals.get(i).end) break;
        } 
        if( i >= intervals.size()) {
            list.add(new Interval(start, end));
        }else if(end < intervals.get(i).start){
            list.add(new Interval(start, end));
            list.add(intervals.get(i));
        }else{
            list.add(new Interval(start, intervals.get(i).end));
        }
        for(i=i+1; i< intervals.size();i++){
            list.add(intervals.get(i));
        }
        return list;
    }
}

O(n)的时间复杂度，O(n)的空间复杂度