[SW Expert Academy] 문제 제목 붙이기 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWkIdD46A5EDFAXC&categoryId=AWkIdD46A5EDFAXC&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=10

SW Expert Academy

 

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();
			HashSet<Character> set = new HashSet<>(); //중복 제거

			int cnt = 0;

			for (int i = 0; i < n; i++) {
				set.add(sc.next().charAt(0));
			}

			ArrayList<Character> list = new ArrayList<>(set);

			Collections.sort(list); //정렬하게 싫으면 위에서 Treeset쓰면 됨

			for (int i = 0; i < list.size(); i++) {

				if (list.get(i) != (char) ('A' + i)) { //아스키 코드로 비교
					break;
				}

				cnt++;
			}

			System.out.println("#" + tc + " " + cnt);

		}
	}
}

 

import java.util.ArrayList;
import java.util.Scanner;
import java.util.TreeSet;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();
			TreeSet<Character> set = new TreeSet<>(); //중복 제거

			int cnt = 0;

			for (int i = 0; i < n; i++) {
				set.add(sc.next().charAt(0));
			}

			ArrayList<Character> list = new ArrayList<>(set);

			for (int i = 0; i < list.size(); i++) {

				if (list.get(i) != (char) ('A' + i)) { //아스키 코드로 비교
					break;
				}

				cnt++;
			}

			System.out.println("#" + tc + " " + cnt);

		}
	}
}