-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathinsertInterval.js
More file actions
56 lines (45 loc) · 2.07 KB
/
insertInterval.js
File metadata and controls
56 lines (45 loc) · 2.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/*
https://leetcode.com/problems/insert-interval/
You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.
Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).
Return intervals after the insertion.
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].
Constraints:
0 <= intervals.length <= 104
intervals[i].length == 2
0 <= starti <= endi <= 105
intervals is sorted by starti in ascending order.
newInterval.length == 2
0 <= start <= end <= 105
*/
const insert = (intervals, newInterval) => {
const result = [];
for (const interval of intervals) {
// 1. Handle new interval already added or current interval end < new interval start
if (newInterval === null || interval[1] < newInterval[0]) {
result.push(interval);
}
// 2. Handle non-overlapping interval where current interval start > new interval end
else if (interval[0] > newInterval[1]) {
result.push(newInterval, interval);
newInterval = null;
}
// 3. Else, use new interval to repeatedly update overlapping values until above cases push to array
else {
newInterval[0] = Math.min(newInterval[0], interval[0]);
newInterval[1] = Math.max(newInterval[1], interval[1]);
}
}
// 4. Handle new interval never being added, so append to results array
if (newInterval !== null) {
result.push(newInterval);
}
return result;
}
module.exports = { insert };