[SW Expert Academy] 영준이의 카드 카운팅 (D3)

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

SW Expert Academy

 

import java.util.HashMap;
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++) {

			HashMap<String, Integer> map = new HashMap<>();
			map.put("S", 13);
			map.put("D", 13);
			map.put("H", 13);
			map.put("C", 13);

			String str = sc.next();

			HashSet<String> set = new HashSet<>();

			for (int i = 0; i < str.length(); i++) {
				set.add(str.substring(i, i + 3));
				map.put(str.substring(i, i+1), map.get(str.substring(i, i+1)) - 1); //일치하는 알파벳이 나오면 1씩 빼준다.
				i += 2;
			}
			
			//System.out.println(map);
			//System.out.println(set);

			if (set.size() != str.length() / 3) { //사이즈가 다르면 겹치는 게 있었다는 뜻
				System.out.println("#" + tc + " " + "ERROR");
				continue;
			}

			System.out.println(
					"#" + tc + " " + map.get("S") + " " + map.get("D") + " " + map.get("H") + " " + map.get("C"));

		}

	}
}