• 문제 링크
https://www.acmicpc.net/problem/11059
• 풀이 코드
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));
s = br.readLine();
bw.write(String.valueOf(find()));
bw.flush();
}
private static int find() {
for (int i = s.length() - (s.length() & 1); i > 0; i -= 2)
for (int j = i; j <= s.length(); j++)
if (sum(j - i, j - 1) == 0) return i;
return 0;
}
private static int sum(int h, int t) {
int sum = 0;
while (h < t) sum += s.charAt(h++) - s.charAt(t--);
return sum;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 4649 Tanning Salon - Data Structure / Java (0) | 2024.04.29 |
---|---|
[백준] 18706 Coffee - Data Structure / Java (1) | 2024.04.28 |
[백준] 4096 팰린드로미터 - Brute Force / Java (0) | 2024.04.26 |
[백준] 3595 맥주 냉장고 - Brute Force / Java (0) | 2024.04.25 |
[백준] 6131 완전 제곱수 - Brute Force / Java (0) | 2024.04.24 |
댓글