| 16 | */ |
| 17 | public class Solution { |
| 18 | public List<Interval> insert(List<Interval> intervals, Interval newInterval) { |
| 19 | if (intervals.isEmpty()) return Collections.singletonList(newInterval); |
| 20 | List<Interval> ans = new ArrayList<>(); |
| 21 | int i = 0, len = intervals.size(); |
| 22 | for (; i < len; ++i) { |
| 23 | Interval interval = intervals.get(i); |
| 24 | if (interval.end < newInterval.start) ans.add(interval); |
| 25 | else break; |
| 26 | } |
| 27 | for (; i < len; ++i) { |
| 28 | Interval interval = intervals.get(i); |
| 29 | if (interval.start <= newInterval.end) { |
| 30 | newInterval.start = Math.min(newInterval.start, interval.start); |
| 31 | newInterval.end = Math.max(newInterval.end, interval.end); |
| 32 | } else break; |
| 33 | } |
| 34 | ans.add(newInterval); |
| 35 | for (; i < len; ++i) { |
| 36 | ans.add(intervals.get(i)); |
| 37 | } |
| 38 | return ans; |
| 39 | } |
| 40 | |
| 41 | public static void main(String[] args) { |
| 42 | Solution solution = new Solution(); |