[백준(Baekjoon)][자바(java)] 10815 : 숫자 카드 / 집합과 맵

 

https://www.acmicpc.net/problem/10815

10815번: 숫자 카드

 

문제 풀이

 

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Set;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws Exception {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int n = Integer.parseInt(br.readLine()), i;
		Set<Integer> set = new HashSet<>(); // card
		StringTokenizer st = new StringTokenizer(br.readLine());
		for (i = 0; i < n; ++i) 
			set.add(Integer.parseInt(st.nextToken()));

		int m = Integer.parseInt(br.readLine());
		st = new StringTokenizer(br.readLine());
		StringBuilder sb = new StringBuilder();
		for (i = 0; i < m; ++i) 
			sb.append((set.contains(Integer.parseInt(st.nextToken())) ? 1 : 0) + " ");

		br.close();
		
		System.out.println(sb.toString());	
	}
}