-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path56.合并区间.js
60 lines (59 loc) · 1.33 KB
/
56.合并区间.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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
* @lc app=leetcode.cn id=56 lang=javascript
*
* [56] 合并区间
*
* https://leetcode-cn.com/problems/merge-intervals/description/
*
* algorithms
* Medium (37.89%)
* Likes: 165
* Dislikes: 0
* Total Accepted: 23.1K
* Total Submissions: 61K
* Testcase Example: '[[1,3],[2,6],[8,10],[15,18]]'
*
* 给出一个区间的集合,请合并所有重叠的区间。
*
* 示例 1:
*
* 输入: [[1,3],[2,6],[8,10],[15,18]]
* 输出: [[1,6],[8,10],[15,18]]
* 解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6].
*
*
* 示例 2:
*
* 输入: [[1,4],[4,5]]
* 输出: [[1,5]]
* 解释: 区间 [1,4] 和 [4,5] 可被视为重叠区间。
*
*/
/**
* @param {number[][]} intervals
* @return {number[][]}
*/
var merge = function(intervals) {
const results = [];
if (!intervals.length) {
return results;
}
intervals.sort((a, b) => a[0] - b[0]);
let start = intervals[0][0];
let end = intervals[0][1];
for (let i = 1; i < intervals.length; i++) {
if (intervals[i][0] > end) {
results.push([start, end]);
start = intervals[i][0];
end = intervals[i][1];
continue;
}
if (intervals[i][1] > end) {
end = intervals[i][1];
}
}
if (!results[results.length - 1] || results[results.length - 1][1] !== end) {
results.push([start, end]);
}
return results;
};