Insert Interval

Question:

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

//********** Hints ************

1: 我们可以把新Interval加入List,然后用上一题的做法merge即可

2：遍历并比较，做法和上题类似，一个一个interval更新

//*****************************

Solution:

/**
 * 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 ArrayList<Interval> insert(ArrayList<Interval> intervals, Interval newInterval) {
     
        ArrayList<Interval> res = new ArrayList<Interval>();
   
        for(Interval i: intervals){
            if(i.end < newInterval.start){
                res.add(i);
            }
            else if(i.start > newInterval.end){
                res.add(newInterval);
                newInterval = i;
            }
            else if(i.end > newInterval.start || i.start < newInterval.end){
                int left = Math.min(i.start, newInterval.start);
                int right = Math.max(i.end, newInterval.end);
                newInterval = new Interval(left, right);
            }
        }
        res.add(newInterval);
        return res;
    }
}