9940. 순열1 - d3

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Arrays;

public class Solution {
	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int T;
		T=Integer.parseInt(br.readLine());
		
		StringBuffer sb = new StringBuffer();
		StringTokenizer st;
		for(int test_case = 1; test_case <= T; test_case++)
		{
			int N = Integer.parseInt(br.readLine());
			st = new StringTokenizer(br.readLine()," ");
			int[] arr = new int[N];
 			String result = "Yes";
			for(int i=0; i<N; i++) {
				arr[Integer.parseInt(st.nextToken())-1]+=1;
			}
			Arrays.sort(arr);
			if(arr[0]!=arr[N-1]) result="No";
			
			sb.append("#"+test_case+" "+result).append('\n');
		}
		System.out.print(sb);
	}
}

 

첨에는 arraylist로 풀었는데 시간 초과 떠서

그냥 int형 배열로 푸니 풀렸다,,^^,,