forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathuraflower.js
More file actions
34 lines (29 loc) · 862 Bytes
/
uraflower.js
File metadata and controls
34 lines (29 loc) · 862 Bytes
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
/**
* @param {number[][]} intervals
* @param {number[]} newInterval
* @return {number[][]}
*/
const insert = function(intervals, newInterval) {
const merged = [];
let i = 0;
// 겹치지 않는 앞부분 push
while (i < intervals.length && intervals[i][1] < newInterval[0]) {
merged.push(intervals[i]);
i++;
}
// 겹치는 부분 처리
while (i < intervals.length && intervals[i][0] <= newInterval[1]) {
newInterval[0] = Math.min(newInterval[0], intervals[i][0]);
newInterval[1] = Math.max(newInterval[1], intervals[i][1]);
i++;
}
merged.push(newInterval);
// 겹치지 않는 뒷부분 push
while (i < intervals.length) {
merged.push(intervals[i]);
i++;
}
return merged;
};
// 시간복잡도: O(n)
// 공간복잡도: O(n) (반환할 배열)