g0001_0100.s0056_merge_intervals.solution.js Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
// #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
// #Big_O_Time_O(n_log_n)_Space_O(n) #2024_12_10_Time_7_ms_(81.68%)_Space_59.2_MB_(41.78%)

/**
 * @param {number[][]} intervals
 * @return {number[][]}
 */
var merge = function(intervals) {
    // Sort intervals based on the starting points
    intervals.sort((a, b) => a[0] - b[0])
    
    const result = []
    let current = intervals[0]
    result.push(current)
    
    for (const next of intervals) {
        if (current[1] >= next[0]) {
            // Merge intervals
            current[1] = Math.max(current[1], next[1])
        } else {
            // Move to the next interval
            current = next;
            result.push(current)
        }
    }
    
    return result;
};

export { merge }