0057. Insert Interval.js

// 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:

// Input: intervals = [[1, 3], [6, 9]], newInterval = [2, 5]
// Output: [[1, 5], [6, 9]]

// Example 2:

// Input: intervals = [[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]], newInterval = [4, 8]
// Output: [[1, 2], [3, 10], [12, 16]]
// Explanation: Because the new interval[4, 8] overlaps with [3, 5], [6, 7], [8, 10].
// NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.


/**
 * @param {number[][]} intervals
 * @param {number[]} newInterval
 * @return {number[][]}
 */
const insert = (intervals, newInterval) => {
  if (!newInterval.length) {
    return [newInterval]
  }
  let res = []
  let flag = 0
  let i
  for (i = 0; i < intervals.length; i++) {
    let interval = intervals[i]
    if (newInterval[0] > interval[1]) {
      res.push(interval)
    } else if (newInterval[1] < interval[0]) {
      res.push(newInterval)
      flag = 1
      break
    } else {
      newInterval[0] = Math.min(newInterval[0], interval[0])
      newInterval[1] = Math.max(newInterval[1], interval[1])
    }
  }
  if (flag === 0) {
    res.push(newInterval)
  } else {
    res = res.concat(intervals.splice(i))
  }
  return res
}
// Runtime: 56 ms, faster than 97.24 % of JavaScript online submissions for Insert Interval.
// Memory Usage: 36.7 MB, less than 87.50 % of JavaScript online submissions for Insert Interval.