[leetcode-in-go] 0057-Insert Interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]

Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

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

func merge(intervals [][]int) [][]int {
	if len(intervals) <= 1 {
		return intervals
	}

	result := [][]int{}

	for i := 0; i < len(intervals); i++ {
		if i == len(intervals)-1 {
			result = append(result, intervals[i])
			return result
		}
		t := make([]int, 2)
		first := intervals[i]
		second := intervals[i+1]
		if first[1] >= second[0] {
			t[0], t[1] = first[0], max(first[1], second[1])
		} else {
			result = append(result, first)
			continue
		}

		for i = i + 2; i < len(intervals); i++ {
			next := intervals[i]
			if t[1] >= next[0] {
				t[1] = max(t[1], next[1])
			} else {
				break
			}
		}
		i--
		result = append(result, t)
	}
	return result
}

func insert(intervals [][]int, newInterval []int) [][]int {

	newIntervals := [][]int{}
	if len(intervals) == 0 {
		return append(newIntervals, newInterval)
	}

	inserted := false
	for _, v := range intervals {
		if v[0] <= newInterval[0] {
			newIntervals = append(newIntervals, v)
		} else {
			if !inserted {
				newIntervals = append(newIntervals, newInterval)
				inserted = true
			}
			newIntervals = append(newIntervals, v)
		}
	}
	if !inserted {
		newIntervals = append(newIntervals, newInterval)
	}

	return merge(newIntervals)
}