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

/** * 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> result = new ArrayList<>();        int newStart = newInterval.start;        int newEnd = newInterval.end;        for(Interval interval : intervals) {            if(overlap(interval, newInterval)) {                newStart = newStart < interval.start? newStart : interval.start;                newEnd = newEnd > interval.end? newEnd : interval.end;            }            else {                result.add(interval);            }        }        int i = 0;        for(i = 0; i < result.size(); i++) {            if(result.get(i).start > newStart) {                break;            }        }        result.add(i, new Interval(newStart, newEnd));        return result;    }        private boolean overlap(Interval interval1, Interval interval2) {        return (interval1.start >= interval2.start && interval1.start <= interval2.end)            || (interval1.end >= interval2.start && interval1.start <= interval2.end);    }}