๐Ÿ“š ์ฝ”๋”ฉํ…Œ์ŠคํŠธ/๋ฐฑ์ค€ & ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

[SWEA][JAVA]D3 : ๋ฌธ์ œ ์ œ๋ชฉ ๋ถ™์ด๊ธฐ

deep_lee 2022. 11. 13. 15:21

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

 

SW Expert Academy

SW ํ”„๋กœ๊ทธ๋ž˜๋ฐ ์—ญ๋Ÿ‰ ๊ฐ•ํ™”์— ๋„์›€์ด ๋˜๋Š” ๋‹ค์–‘ํ•œ ํ•™์Šต ์ปจํ…์ธ ๋ฅผ ํ™•์ธํ•˜์„ธ์š”!

swexpertacademy.com

 

 


์ž…๋ ฅ๋ฐ›์€ ๋ฌธ์ž์—ด๋“ค์˜ ์ฒซ๊ธ€์ž๋งŒ ๋”ฐ๋กœ ๋ฌธ์ž์—ด a ๋กœ ๋งŒ๋“ ๋’ค์—

"A-Z" ๋ฌธ์ž์—ด์„ ์ˆœ์„œ๋Œ€๋กœ , a์— ์žˆ์œผ๋ฉด cnt ++..

์ˆœ์„œ๋Œ€๋กœ ์žˆ์–ด์•ผํ•˜๋‹ˆ๊นŒ ๋‹ค๋ฅธ ์ˆœ๊ฐ„ break ๊ฑธ์–ด์„œ ๋๋‚ด๋ฉด๋˜๋Š”๋ฐ

๋ฌธ์ œ๋ฅผ ํ’€๋•Œ ์ค‘๋ณต์„ ์ œ๊ฑฐํ•œ๋‹ค๊ณ  set์„ ์‚ฌ์šฉํ–ˆ๋Š”๋ฐ, ๋‹คํ’€๊ณ ๋ณด๋‹ˆ ๊ตณ์ด ์ค‘๋ณต์„ ์ œ๊ฑฐํ•  ํ•„์š”๋Š” ์—†์—ˆ๋˜๊ฑฐ ๊ฐ™๋‹ค.

 

 

import java.util.Scanner;
import java.util.HashSet;
class Solution{
    public static void main(String args[]) throws Exception{
        Scanner kb=new Scanner(System.in);
        int T=kb.nextInt();
        for(int t=1; t<=T; t++){
            int n=kb.nextInt();
            String[] arr=new String[n];
            for(int i=0; i<n; i++) arr[i]=kb.next();
            
            String a="";
            for(int i=0; i<n; i++){
                a+=arr[i].charAt(0);
            }
            
            char[] ch=a.toCharArray();
            int cnt=0;
            HashSet<Character> set=new HashSet<>();
            for(int i=0; i<ch.length; i++) set.add(ch[i]);
            String s="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
            
            for(int i=0; i<set.size(); i++){
                if(set.contains(s.charAt(i)))
                    cnt++;
                else
                    break;
            }
            System.out.println("#"+t+" "+cnt);
        }
    }
}