• 문제 링크
https://www.acmicpc.net/problem/27962
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class Main {
static String s;
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 n = Integer.parseInt(br.readLine());
s = br.readLine();
while (--n > 0) if (compare(n)) break;
bw.write(n > 0 ? "YES" : "NO");
bw.flush();
}
private static boolean compare(int n) {
boolean b = false;
for (int i = 0; i < n; i++) {
if (s.charAt(i) == s.charAt(s.length() - n + i)) continue;
if (b) return false;
else b = true;
}
return b;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 25270 99 Problems - Brute Force / Java (0) | 2024.11.14 |
---|---|
[백준] 2061 좋은 암호 - Brute Force / Java (0) | 2024.11.13 |
[백준] 15832 Aku Negaraku - Data Structure / Java (0) | 2024.11.11 |
[백준] 6973 Dynamic Dictionary Coding - Data Structure / Java (0) | 2024.11.10 |
[백준] 19817 Company Merging - Data Structure / Java (0) | 2024.11.09 |
댓글