85. Insert Interval

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        res, i, n = [], 0, len(intervals)
        s, e = newInterval
        while i < n and intervals[i][1] < s:        # entirely before
            res.append(intervals[i]); i += 1
        while i < n and intervals[i][0] <= e:       # overlapping: absorb
            s, e = min(s, intervals[i][0]), max(e, intervals[i][1]); i += 1
        res.append([s, e])
        res.extend(intervals[i:])                   # entirely after
        return res

class Solution {
    public int[][] insert(int[][] intervals, int[] newInterval) {
        List<int[]> res = new ArrayList<>();
        int i = 0, n = intervals.length, s = newInterval[0], e = newInterval[1];
        while (i < n && intervals[i][1] < s) res.add(intervals[i++]);
        while (i < n && intervals[i][0] <= e) { s = Math.min(s, intervals[i][0]); e = Math.max(e, intervals[i][1]); i++; }
        res.add(new int[]{s, e});
        while (i < n) res.add(intervals[i++]);
        return res.toArray(new int[0][]);
    }
}

class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        vector<vector<int>> res;
        int i = 0, n = intervals.size(), s = newInterval[0], e = newInterval[1];
        while (i < n && intervals[i][1] < s) res.push_back(intervals[i++]);
        while (i < n && intervals[i][0] <= e) { s = min(s, intervals[i][0]); e = max(e, intervals[i][1]); i++; }
        res.push_back({s, e});
        while (i < n) res.push_back(intervals[i++]);
        return res;
    }
};

function insert(intervals, newInterval) {
  const res = [];
  let i = 0, [s, e] = newInterval;
  while (i < intervals.length && intervals[i][1] < s) res.push(intervals[i++]);
  while (i < intervals.length && intervals[i][0] <= e) { s = Math.min(s, intervals[i][0]); e = Math.max(e, intervals[i][1]); i++; }
  res.push([s, e]);
  while (i < intervals.length) res.push(intervals[i++]);
  return res;
}