Function merge0

merge_intervals_56/solution.go:38–53

First solution

(intervals [][]int)

// First solution
func merge0(intervals [][]int) [][]int {
	sort.Slice(intervals, func(i, j int) bool {
		return intervals[i][0] < intervals[j][0]
	})

	merged := make([][]int, 0)
	for i := 0; i < len(intervals); i++ {
		if len(merged) == 0 || intervals[i][0] > merged[len(merged)-1][1] {
			merged = append(merged, intervals[i])
		} else if intervals[i][1] > merged[len(merged)-1][1] {
			merged[len(merged)-1][1] = intervals[i][1]
		}
	}

	return merged
}