力扣插入区间

// 插入区间
package interval

import "sort"

// 结合合并区间
func insert(intervals [][]int, newInterval []int) [][]int {
	ans := append(intervals, newInterval)
	return Merge1(ans)
}

func Merge1(intervals [][]int) [][]int {
	if len(intervals) == 0 {
		return [][]int{}
	}
	sort.Slice(intervals, func(i, j int) bool {
		return intervals[i][0] < intervals[j][0]
	})
	merged := [][]int{}
	for i := 0; i < len(intervals); i++ {
		L, R := intervals[i][0], intervals[i][1]
		if len(merged) == 0 || merged[len(merged)-1][1] < L {
			merged = append(merged, []int{L, R})
		} else {
			merged[len(merged)-1][1] = maxMerge1(merged[len(merged)-1][1], R)
		}
	}
	return merged
}

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