[SW Expert Academy] 문자열 교집합 (D3)

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

SW Expert Academy

 

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();
			int m = sc.nextInt();

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

			int cnt = 0;

			for (int i = 0; i < n; i++) {
				set.add(sc.next()); //한 집합은 set에 추가
			}

			for (int i = 0; i < m; i++) {
				String word = sc.next();
				if (set.contains(word)) { //set에 있으면
					cnt++; //카운트 증가
				}
			}

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

		}
	}
}