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

If output is List:

/**
 * 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) {
        if (intervals.size() == 0) {
            intervals.add(newInterval);
            return intervals;
        }
        ArrayList<Interval> res = new ArrayList<Interval>();
        int cur = 0;
        while (cur < intervals.size() && intervals.get(cur).end < newInterval.start) {
            res.add(intervals.get(cur));
            cur++;
        }
        while (cur < intervals.size() && intervals.get(cur).start <= newInterval.end) {
            newInterval.start = Math.min(newInterval.start, intervals.get(cur).start);
            newInterval.end = Math.max(newInterval.end, intervals.get(cur).end);
            cur++;
        }
        res.add(newInterval);
        while (cur < intervals.size()) {
            res.add(intervals.get(cur));
            cur++;
        }
        return res;
    }
}

If output is array:

class Solution {
    public int[][] insert(int[][] intervals, int[] newInterval) {
        int i = 0;
        ArrayList<int[]> list = new ArrayList<int[]>();
        while (i < intervals.length && intervals[i][1] < newInterval[0]) {
            list.add(intervals[i]);
            i ++;
        }
        
        while (i < intervals.length && newInterval[1] >= intervals[i][0]) {
            newInterval[0] = Math.min(newInterval[0], intervals[i][0]);
            newInterval[1] = Math.max(newInterval[1], intervals[i][1]);
            i ++;
        }
        
        list.add(newInterval);
        
        while (i < intervals.length) {
            list.add(intervals[i]);
            i ++;
        }
        
        int[][] res = new int[list.size()][2];
        for (int j = 0; j < list.size(); j ++) {
            res[j] = list.get(j);
        }
        return res;
     }
}

 24-27 line can also be

        int[][] res = new int[list.size()][2];
        res = list.toArray(res);
        return res;