[Java] 8934. 팰린드롬 공포증

D4-8934. 팰린드롬 공포증

 

문제출저: https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AW5jJcZ68LsDFATQ&categoryId=AW5jJcZ68LsDFATQ&categoryType=CODE

SW Expert Academy

부분 문자열의 팰린드롬 가능여부는 a, b, c의 등장 횟수에서 판단할 수 있다.

 

import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.Scanner;

class Solution {
	
	public static void main(String args[]) throws Exception {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		sc.nextLine();
		
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		
		for (int test_case = 1; test_case <= T; test_case++) {
			String str = sc.nextLine();
			int[] numbers = new int[3];
			int len = str.length();
			for (int i = 0; i < len; i++) {
				char c = str.charAt(i);
				if (c == 'a')
					numbers[0]++;
				if (c == 'b')
					numbers[1]++;
				if (c == 'c')
					numbers[2]++;
			}
			int max = Arrays.stream(numbers).max().getAsInt();
			int min = Arrays.stream(numbers).min().getAsInt();
			if (max - min <= 1)
				bw.write("#" + test_case + " YES\n");
			else
				bw.write("#" + test_case + " NO\n");
		}
		
		bw.flush();
		bw.close();
	}
}