-
Notifications
You must be signed in to change notification settings - Fork 111
/
Copy pathsolution.java
52 lines (39 loc) · 1.42 KB
/
solution.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
52
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// theLoveLetterMystery function
static int theLoveLetterMystery(String s) {
int count = 0;
int i = 0; // pointer at starting of string s
int j = s.length() - 1; // pointer at end of string s
// check for palindromic string
while (i <= j) {
if (s.charAt(i) != s.charAt(j)) {
count += Math.abs(((int) s.charAt(i)) - ((int) s.charAt(j)));
}
i++; j--;
}
// minimum number of operations corresponding to each test case
return count;
}
private static final Scanner scanner = new Scanner(System.in);
// main function
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int q = scanner.nextInt(); // number of queries
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int qItr = 0; qItr < q; qItr++) {
String s = scanner.nextLine(); // string
int result = theLoveLetterMystery(s);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
}
bufferedWriter.close();
scanner.close();
}
}