forked from ecmadao/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNo56.merge-intervals.js
More file actions
45 lines (44 loc) · 1.01 KB
/
No56.merge-intervals.js
File metadata and controls
45 lines (44 loc) · 1.01 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
/**
* Difficulty:
* Medium
*
* Desc:
* Given a collection of intervals, merge all overlapping intervals.
*
* Example:
* Given [1,3],[2,6],[8,10],[15,18],
* return [1,6],[8,10],[15,18].
*
* 给一系列数组,数组内取值有重叠,要求合并重叠的数组
*/
/**
* 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) => a.start - b.start);
var results = [];
for (var i = 0; i < intervals.length; i += 1) {
var interval = intervals[i];
if (i + 1 < intervals.length) {
if (interval.end >= intervals[i + 1].start) {
intervals[i + 1] = new Interval(
interval.start,
interval.end > intervals[i + 1].end ? interval.end : intervals[i + 1].end
);
} else {
results.push(interval);
}
} else {
results.push(interval);
}
}
return results;
};