Tcdian / keep

今天不想做,所以才去做。
MIT License
5 stars 1 forks source link

56. Merge Intervals #115

Open Tcdian opened 4 years ago

Tcdian commented 4 years ago

56. Merge 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 considered overlapping.

Example 3

Input: [[1,5],[2,4]]
Output: [[1,5]]
Tcdian commented 4 years ago

Solution

/**
 * @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;
};