This repository was archived by the owner on Sep 20, 2023. It is now read-only.
-
-
Notifications
You must be signed in to change notification settings - Fork 164
/
Copy pathrange-module.go
executable file
·131 lines (105 loc) · 2.68 KB
/
range-module.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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
package problem0715
import (
"sort"
)
// RangeModule 记录了跟踪的范围
type RangeModule struct {
ranges []*interval
}
// Constructor 返回新建的 RangeModule
func Constructor() RangeModule {
return RangeModule{ranges: make([]*interval, 0, 2048)}
}
// AddRange 添加追踪的返回
func (r *RangeModule) AddRange(left int, right int) {
it := &interval{left: left, right: right}
n := len(r.ranges)
i := sort.Search(n, func(i int) bool {
return left <= r.ranges[i].right
})
var j int
for j = i; j < n && r.ranges[j].left <= right; j++ {
it.add(r.ranges[j])
}
if i == j {
r.ranges = append(r.ranges, nil)
}
copy(r.ranges[i+1:], r.ranges[j:])
r.ranges = r.ranges[:n-j+i+1]
r.ranges[i] = it
}
// QueryRange 返回 true 如果 [left, right) 全部都在追踪范围内
func (r *RangeModule) QueryRange(left int, right int) bool {
n := len(r.ranges)
i := sort.Search(n, func(i int) bool {
return right <= r.ranges[i].right
})
return 0 <= i && i < n && r.ranges[i].isCover(left, right)
}
// RemoveRange 从追踪范围中删除 [left,right)
func (r *RangeModule) RemoveRange(left int, right int) {
it := &interval{left: left, right: right}
n := len(r.ranges)
if n == 0 {
return
}
i := sort.Search(n, func(i int) bool {
return left < r.ranges[i].right
})
temp := make([]*interval, 0, 16)
var j int
for j = i; j < n && r.ranges[j].left < right; j++ {
ra, rb := minus(r.ranges[j], it)
if ra != nil {
temp = append(temp, ra)
}
if rb != nil {
temp = append(temp, rb)
}
}
if i == j {
return
}
r.ranges = append(r.ranges, nil)
copy(r.ranges[i+len(temp):], r.ranges[j:])
r.ranges = r.ranges[:n-j+i+len(temp)]
for k := 0; k < len(temp); k++ {
r.ranges[i+k] = temp[k]
}
}
type interval struct {
left, right int
}
func (it *interval) isCover(left, right int) bool {
return it.left <= left && right <= it.right
}
func (it *interval) add(a *interval) {
if a.left < it.left {
it.left = a.left
}
if it.right < a.right {
it.right = a.right
}
}
// 返回 a-b
func minus(a, b *interval) (*interval, *interval) {
if b.left <= a.left && a.right <= b.right {
return nil, nil
}
if b.left <= a.left && a.left < b.right && b.right < a.right {
return &interval{left: b.right, right: a.right}, nil
}
if a.left < b.left && b.left < a.right && a.right < b.right {
return &interval{left: a.left, right: b.left}, nil
}
// a.left < b.left && b.right < a.right
return &interval{left: a.left, right: b.left},
&interval{left: b.right, right: a.right}
}
/**
* Your RangeModule object will be instantiated and called as such:
* obj := Constructor();
* obj.AddRange(left,right);
* param_2 := obj.QueryRange(left,right);
* obj.RemoveRange(left,right);
*/