56. Merge Intervals

merge-intervals.go

// https://leetcode.com/problems/merge-intervals/
//
// Time: O(n log n)
// Space: O(n)
//
// n = number of intervals

// .................... //

func merge(intervals [][]int) [][]int {
    sort.Slice(intervals, func(i, j int) bool {
        return intervals[i][0] < intervals[j][0]
    })
    
    res := make([][]int, 0)
    for _, interval := range intervals {
        if len(res) > 0 && interval[0] <= res[len(res)-1][1] {
            temp := res[len(res)-1]
            res = res[:len(res)-1]
            interval[0] = min(temp[0], interval[0]) 
            interval[1] = max(temp[1], interval[1])
        }
        res = append(res, interval)
    }

    return res
}