• 문제 링크
https://www.acmicpc.net/problem/2495
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
for (int i = 0; i < 3; i++) {
int n = read(), m = n % 10, cnt = 1, max = 0;
while ((n /= 10) > 0) {
int k = n % 10;
if (m == k) cnt++;
else {
max = Math.max(max, cnt);
cnt = 1;
}
m = k;
}
bw.write(Math.max(max, cnt) + "\n");
}
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 17203 ∑|ΔEasyMAX| - Implementation / Java (0) | 2025.07.12 |
---|---|
[백준] 13717 포켓몬 GO - Implementation / Java (0) | 2025.07.11 |
[백준] 2997 네 번째 수 - Implementation / Java (0) | 2025.07.09 |
[백준] 1252 이진수 덧셈 - Implementation / Java (0) | 2025.07.08 |
[백준] 11655 ROT13 - Implementation / Java (0) | 2025.07.07 |
댓글