-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path56. Merge Intervals.js
46 lines (40 loc) · 1.1 KB
/
56. Merge Intervals.js
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
/*Given a collection of intervals, merge all overlapping intervals.
Example 1:
Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:
Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considerred overlapping.*/
/**
* Definition for an interval.
* function Interval(start, end) {
* this.start = start;
* this.end = end;
* }
*/
/**
* @param {Interval[]} intervals
* @return {Interval[]}
*/
var merge = function(intervals) {
intervals.sort((a, b) => {
if (a.start !== b.start) return a.start - b.start
else return a.end - b.end
})
var len = intervals.length
if (len <= 1) return intervals
var res = [], i = 0, cur = intervals[i], start = cur.start, end = cur.end
while (++i < len) {
cur = intervals[i]
if (cur.start <= end) end = Math.max(end, cur.end)
else {
res.push(new Interval(start, end))
start = cur.start
end = cur.end
}
}
if (start !== null) res.push(new Interval(start, end))
return res
}