57. Insert Interval leetcode

insert.go

import "sort"
/**
 * Definition for an interval.
 * type Interval struct {
 *	   Start int
 *	   End   int
 * }
 */
 
func insert(intervals []Interval, newInterval Interval) []Interval {
	intervals = append(intervals, newInterval)
	sort.SliceStable(intervals, func(i, j int) bool {
		return intervals[i].Start < intervals[j].Start
	})
	return merge(intervals)
}

func merge(intervals []Interval) []Interval {
	merged := []Interval{}
	for _, interval := range intervals {
		n := len(merged)
		if n == 0 || merged[n-1].End < interval.Start {
			merged = append(merged, interval)
		} else {
			merged[n-1].End = max(merged[n-1].End, interval.End)
		}
	}
	return merged
}

func max(a, b int) int {
	if a > b {
		return a
	} else {
		return b
	}
}