Tasks Details
medium
Find the minimal nucleotide from a range of sequence DNA.
Task Score
100%
Correctness
100%
Performance
100%
A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is the minimal impact factor of nucleotides contained in a particular part of the given DNA sequence?
The DNA sequence is given as a non-empty string S = S[0]S[1]...S[N-1] consisting of N characters. There are M queries, which are given in non-empty arrays P and Q, each consisting of M integers. The K-th query (0 ≤ K < M) requires you to find the minimal impact factor of nucleotides contained in the DNA sequence between positions P[K] and Q[K] (inclusive).
For example, consider string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6The answers to these M = 3 queries are as follows:
- The part of the DNA between positions 2 and 4 contains nucleotides G and C (twice), whose impact factors are 3 and 2 respectively, so the answer is 2.
- The part between positions 5 and 5 contains a single nucleotide T, whose impact factor is 4, so the answer is 4.
- The part between positions 0 and 6 (the whole string) contains all nucleotides, in particular nucleotide A whose impact factor is 1, so the answer is 1.
Write a function:
class Solution { public int[] solution(String S, int[] P, int[] Q); }
that, given a non-empty string S consisting of N characters and two non-empty arrays P and Q consisting of M integers, returns an array consisting of M integers specifying the consecutive answers to all queries.
Result array should be returned as an array of integers.
For example, given the string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6the function should return the values [2, 4, 1], as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- M is an integer within the range [1..50,000];
- each element of arrays P and Q is an integer within the range [0..N - 1];
- P[K] ≤ Q[K], where 0 ≤ K < M;
- string S consists only of upper-case English letters A, C, G, T.
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 8
Time spent on task 6 minutes
Notes
not defined yet
Task timeline
Code: 01:08:18 UTC,
java,
autosave
Code: 01:08:23 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
Code: 01:08:46 UTC,
java,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
User test case 1:
['GT', [0, 0, 1], [0, 1, 1]]
Analysis
Code: 01:09:49 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
System.out.println(ans[0]);
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
Code: 01:10:06 UTC,
java,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
System.out.println(gArray[Q[i]]);
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
User test case 1:
['GT', [0, 0, 1], [0, 1, 1]]
Analysis
Code: 01:10:52 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
Code: 01:10:59 UTC,
java,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
System.out.println(gArray[Q[i]]);
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
User test case 1:
['GT', [0, 0, 1], [0, 1, 1]]
Analysis
Code: 01:12:13 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
Code: 01:12:16 UTC,
java,
verify,
result: Failed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
System.out.println(gArray[Q[i]]);
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
User test case 1:
['GT', [0, 0, 1], [0, 1, 1]]
Analysis
expand all
Example tests
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:37) at Exec.run(exec.java:50) at Exec.main(exec.java:36)stdout:
0 0
Code: 01:12:31 UTC,
java,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
System.out.println(gArray[i]);
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
User test case 1:
['GT', [0, 0, 1], [0, 1, 1]]
Analysis
Code: 01:13:31 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
}
System.out.println(gArray[i]);
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
Code: 01:13:39 UTC,
java,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
case 'T':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
}
System.out.println(gArray[i]);
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
User test case 1:
['GT', [0, 0, 1], [0, 1, 1]]
Analysis
Code: 01:13:52 UTC,
java,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
case 'T':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}
User test case 1:
['GT', [0, 0, 1], [0, 1, 1]]
Analysis
Code: 01:13:56 UTC,
java,
final,
score:
100
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] aArray = new int[S.length()];
int[] cArray = new int[S.length()];
int[] gArray = new int[S.length()];
switch (S.charAt(0)) {
case 'A':
aArray[0]++;
break;
case 'C':
cArray[0]++;
break;
case 'G':
gArray[0]++;
break;
}
for (int i = 1; i <S.length(); i++) {
switch (S.charAt(i)) {
case 'A':
aArray[i] = aArray[i-1] + 1;
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
case 'C':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1] + 1;
gArray[i] = gArray[i-1];
break;
case 'G':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1] + 1;
break;
case 'T':
aArray[i] = aArray[i-1];
cArray[i] = cArray[i-1];
gArray[i] = gArray[i-1];
break;
}
}
int[] ans = new int[P.length];
for (int i = 0; i < P.length; i++) {
if(P[i] == 0){
if(aArray[Q[i]] > 0){
ans[i] = 1;
} else if(cArray[Q[i]] > 0){
ans[i] = 2;
} else if(gArray[Q[i]] > 0){
ans[i] = 3;
} else{
ans[i] = 4;
}
} else{
if(aArray[Q[i]] > aArray[P[i]-1]){
ans[i] = 1;
} else if(cArray[Q[i]] > cArray[P[i]-1]){
ans[i] = 2;
} else if(gArray[Q[i]] > gArray[P[i]-1]){
ans[i] = 3;
} else{
ans[i] = 4;
}
}
}
return ans;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N + M)
expand all
Correctness tests
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
1.
0.008 s
OK
1.
0.008 s
OK