Repository navigation
Expand file tree
/
Copy pathPalindromeString.java
More file actions
66 lines (56 loc) · 1.73 KB
/
Copy pathPalindromeString.java
File metadata and controls
66 lines (56 loc) · 1.73 KB
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
import java.io.*;
public class PalindromeString {
static String input;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int T = Integer.parseInt(br.readLine());
for (int i = 0; i < T; i++) {
input = br.readLine();
int left = 0;
int right = input.length() - 1;
// 회문이면
if (Palindrome(left, right)) {
bw.write("0" + "\n");
continue;
}
// 회문이 아니면
if (NotPalindrome(left, right)) {
bw.write("1" + "\n");
} else {
bw.write("2" + "\n");
}
}
bw.flush();
bw.close();
br.close();
}
// 회문인지 검사
private static boolean Palindrome(int left, int right) {
while(left <= right) {
if (input.charAt(left) != input.charAt(right)) {
return false;
}
left++;
right--;
}
return true;
}
// 회문이 아닐때
private static boolean NotPalindrome(int left, int right) {
while(left <= right) {
if(input.charAt(left) != input.charAt(right)) {
boolean a = Palindrome(left + 1,right);
boolean b = Palindrome(left,right - 1);
if(a == false && b == false) {
return false;
} else{
return true;
}
}
left++;
right--;
}
return true;
}
}