-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
60 lines (49 loc) · 853 Bytes
/
main.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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
package main
import (
"fmt"
"sort"
)
func main() {
fmt.Println(findRightInterval([][]int{{3, 4}, {2, 3}, {1, 2}}))
}
func findRightInterval(it [][]int) []int {
var infos []info
for i, v := range it {
infos = append(infos, info{
arr: v,
ind: i,
})
}
sort.Slice(infos, func(i, j int) bool {
return infos[i].arr[0] < infos[j].arr[0]
})
result := make([]int, len(it))
// fmt.Println(infos)
for i, v := range it {
result[i] = findRight(infos, v)
}
return result
}
// [1,2],[2,3],[3,4]
func findRight(infos []info, target []int) int {
// fmt.Println(target)
l, r := -1, len(infos)
var found bool
for r-l > 1 {
mid := l + (r-l)/2
if infos[mid].arr[0] >= target[1] {
r = mid
found = true
} else {
l = mid
}
}
if !found {
return -1
}
return infos[r].ind
}
type info struct {
arr []int
ind int
}