g0001_0100.s0056_merge_intervals.solution.ts 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) #2023_10_01_Time_84_ms_(92.06%)_Space_49.9_MB_(69.16%)

function merge(intervals: number[][]): number[][] {
    let result = []
    intervals.sort((a, b) => a[0] - b[0])
    for (let i = 0; i < intervals.length; i++) { //NOSONAR
        let len = result.length
        if (len > 0 && intervals[i][0] <= result[len - 1][1]) {
            if (result[len - 1][0] >= intervals[i][0]) {
                result[len - 1][0] = intervals[i][0]
            }
            if (result[len - 1][1] <= intervals[i][1]) {
                result[len - 1][1] = intervals[i][1]
            }
        } else {
            result.push(intervals[i])
        }
    }
    return result
}

export { merge }