[SWEA] 1221 : GNS

https://swexpertacademy.com/main/talk/solvingClub/problemView.do?solveclubId=AV6kld8aisgDFASb&contestProbId=AV14jJh6ACYCFAYD&probBoxId=AV-4MojKLNADFATz&type=PROBLEM&problemBoxTitle=%5BD2~D3+%EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4%5D+%EA%B8%B0%EC%B4%88+%EB%8B%A4%EC%A7%80%EA%B8%B0+Part4&problemBoxCnt=14 

SW Expert Academy

Arrays.asList로 생성된 list는 크기가 고정되어있어서 add와 remove 메서드를 지원하지 않음을 알게 됐음.

 

내 코드

메모리 : 33732 KB

시간 : 162 ms

코드길이 : 1125 B

 

[내 코드]

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

public class Solution {
	static String[] number = {"ZRO", "ONE", "TWO", "THR", "FOR", "FIV", "SIX", "SVN", "EGT", "NIN"};
	static List<String> list;

	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;
		
		list = Arrays.asList(number);
		
		int T = Integer.parseInt(br.readLine());
		while(T-- > 0) {
			st = new StringTokenizer(br.readLine());
			
			String testcase = st.nextToken();
			sb.append(testcase).append('\n');
			int N = Integer.parseInt(st.nextToken());
			
			int[] arr = new int[N];
			st = new StringTokenizer(br.readLine());
			for(int n = 0; n < N; n++) {
				arr[n] = list.indexOf(st.nextToken());
			}
			//오름차순 정렬
			Arrays.sort(arr);
			for(int n = 0; n < N; n++) {
				sb.append(list.get(arr[n])).append(' ');
			}
			sb.append('\n');
		}
		System.out.print(sb);

	}

}