-
Notifications
You must be signed in to change notification settings - Fork 0
/
genomic_range_query.go
56 lines (51 loc) · 1.62 KB
/
genomic_range_query.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
package solution
func Solution(S string, P []int, Q []int) []int {
PrefixSumMatrix := InitializePrefixSumMatrix(len(S))
CalculatePrefixSumMatrix(PrefixSumMatrix, S)
return CalculateMinFactor(PrefixSumMatrix, S, P, Q)
}
func InitializePrefixSumMatrix(length int) [][]int{
PrefixSumMatrix := make([][]int, 3)
for i := 0; i < 3; i ++ {
PrefixSumMatrix[i] = make([]int, length + 1)
for j := 0; j < length; j++ {
PrefixSumMatrix[i][j] = 0;
}
}
return PrefixSumMatrix
}
func CalculatePrefixSumMatrix(PrefixSumMatrix [][]int, S string){
for i := 0; i < len(S); i++ {
a, c, g := 0, 0, 0
if ('A' == S[i]){
a = 1;
}
if ('C' == S[i]){
c = 1;
}
if ('G' == S[i]){
g = 1;
}
PrefixSumMatrix[0][i+1] = PrefixSumMatrix[0][i] + a
PrefixSumMatrix[1][i+1] = PrefixSumMatrix[1][i] + c
PrefixSumMatrix[2][i+1] = PrefixSumMatrix[2][i] + g
}
return
}
func CalculateMinFactor(PrefixSumMatrix [][]int, S string, P []int, Q []int) []int {
result := make([]int, len(P))
for i := 0; i < len(P); i++ {
FromIndex := P[i]
ToIndex := Q[i] + 1
if (PrefixSumMatrix[0][ToIndex] - PrefixSumMatrix[0][FromIndex] > 0) {
result[i] = 1;
} else if (PrefixSumMatrix[1][ToIndex] - PrefixSumMatrix[1][FromIndex] > 0) {
result[i] = 2;
} else if (PrefixSumMatrix[2][ToIndex] - PrefixSumMatrix[2][FromIndex] > 0) {
result[i] = 3;
} else {
result[i] = 4;
}
}
return result
}