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
42
43
44
45
46
47
| // @Title: 合并区间 (Merge Intervals)
// @Author: 15816537946@163.com
// @Date: 2020-11-29 14:27:46
// @Runtime: 12 ms
// @Memory: 4.6 MB
func merge(intervals [][]int) [][]int {
if len(intervals) <= 1 {
return intervals
}
sort.Sort(Its(intervals))
res := make([][]int, 0, len(intervals))
tmp := intervals[0]
for i := range intervals {
if intervals[i][0] <= tmp[1] {
// merge
tmp[1] = max(intervals[i][1], tmp[1])
} else {
res = append(res, tmp)
tmp = intervals[i]
}
}
res = append(res, tmp)
return res
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
type Its [][]int
func (t Its) Less(i, j int) bool {
return t[i][0] < t[j][0]
}
func (t Its) Swap(i, j int) {
t[i], t[j] = t[j], t[i]
}
func (t Its) Len() int {
return len(t)
}
|