forked from invzhi/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
code.go
41 lines (33 loc) 路 944 Bytes
/
code.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
// 56. Merge Intervals
// Given a collection of intervals, merge all overlapping intervals.
// Example 1:
// Input: [[1,3],[2,6],[8,10],[15,18]]
// Output: [[1,6],[8,10],[15,18]]
// Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
// Example 2:
// Input: [[1,4],[4,5]]
// Output: [[1,5]]
// Explanation: Intervals [1,4] and [4,5] are considerred overlapping.
package leetcode
import "sort"
// Interval represents interval with two values.
type Interval struct {
Start int
End int
}
func merge(intervals []Interval) []Interval {
if len(intervals) == 0 {
return nil
}
sort.Slice(intervals, func(i, j int) bool { return intervals[i].Start < intervals[j].Start })
var i int
for _, interval := range intervals {
if intervals[i].End < interval.Start {
i++
intervals[i] = interval
} else if interval.End > intervals[i].End {
intervals[i].End = interval.End
}
}
return intervals[:i+1]
}