Open Tcdian opened 4 years ago
/**
* @param {number[][]} intervals
* @return {number[][]}
*/
var merge = function(intervals) {
const merged = [];
intervals.sort(([a], [b]) => a - b);
for (let i = 0; i < intervals.length; i++) {
if (merged.length === 0 || intervals[i][0] > merged[merged.length - 1][1]) {
merged.push([intervals[i][0], intervals[i][1]]);
} else {
merged[merged.length - 1][1] = Math.max(intervals[i][1], merged[merged.length - 1][1]);
}
}
return merged;
};
56. Merge Intervals
给出一个区间的集合,请合并所有重叠的区间。
Example 1
Example 2
Example 3