-
Notifications
You must be signed in to change notification settings - Fork 10
/
DNApride.java
51 lines (42 loc) · 965 Bytes
/
DNApride.java
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
//https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/dna-pride/
import java.util.*;
class DNApride
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
int T = Integer.parseInt(in.nextLine());
for(int i=0; i<T; i++)
{
int N = Integer.parseInt(in.nextLine());
char arr[] = new char[N];
arr = in.nextLine().toCharArray();
int flag = 0;
for(int k=0; k<arr.length; k++)
{
switch(arr[k])
{
case 'A':
arr[k] = 'T';
break;
case 'T':
arr[k] = 'A';
break;
case 'G':
arr[k] = 'C';
break;
case 'C':
arr[k] = 'G';
break;
default:
flag = 1;
break;
}
}
if(flag == 0)
System.out.println(arr);
else
System.out.println("Error RNA nucleobases found!");
}
}
}