435. 无重叠区间
要注意这种情况,所以不是无脑选择最左边的,而是选择右区间小的那个
func eraseOverlapIntervals(intervals [][]int) int {
sort.Slice(intervals, func(i, j int)bool{
if intervals[i][0] == intervals[j][0]{
return intervals[i][1] < intervals[j][1]
}
return intervals[i][0] < intervals[j][0]
})
right := math.MinInt64
count := 0
for i := 0; i < len(intervals); i++{
if right <= intervals[i][0]{
right = intervals[i][1]
}else{
right = int(math.Min(float64(intervals[i][1]), float64(right)))
count++
}
}
fmt.Print(intervals)
return count
}
763.划分字母区间
首先通过map来标记当前子串中最后出现的那个元素的下标
下一次遍历的时候当遍历到这个最后的下表,意味着可以截断了
func partitionLabels(s string) []int {
hash := make(map[byte]int, 0)
for i := 0; i < len(s); i++{
hash[s[i]] = i
}
res := make([]int, 0)
maxlen := 0
tmp := 0
for i := 0; i < len(s); i++{
if maxlen < hash[s[i]]{
maxlen = hash[s[i]]
}
if i == maxlen{
res = append(res, maxlen - tmp + 1)
tmp = i + 1
}
}
return res
}
56. 合并区间
需要注意第一个区间和最后一个区间有没有插入到res中即可。
func merge(intervals [][]int) [][]int {
res := make([][]int, 0)
sort.Slice(intervals, func(i, j int)bool{
if intervals[i][0] == intervals[j][0]{
return intervals[i][1] < intervals[j][1]
}
return intervals[i][0] < intervals[j][0]
})
left := intervals[0][0]
right := intervals[0][1]
for i := 0; i < len(intervals); i++{
if right < intervals[i][0]{
tmp := make([]int, 2)
tmp[0] = left
tmp[1] = right
res = append(res, append([]int(nil), tmp...))
left = intervals[i][0]
right = intervals[i][1]
}else{
right = int(math.Max(float64(intervals[i][1]), float64(right)))
}
}
tmp := make([]int, 2)
tmp[0] = left
tmp[1] = right
res = append(res, append([]int(nil), tmp...))
return res
}