Insert Interval

lc 57

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.

/**
 * 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) {
        List<Interval>  res = new ArrayList<Interval>();
        if(intervals == null || intervals.size() == 0){

            res.add(newInterval);
            return res;
        }
        int i = 0;
        while( i < intervals.size() && intervals.get(i).end < newInterval.start){
            res.add(intervals.get(i));
            i++;
        }
        while(i < intervals.size() && newInterval.end >= intervals.get(i).start){
             newInterval.start = Math.min(newInterval.start, intervals.get(i).start);
             newInterval.end = Math.max(newInterval.end, intervals.get(i).end);
             i++;
        }
        res.add(newInterval);
        res.addAll(intervals.subList(i, intervals.size()));
        return res;

    }
}