[백준_JAVA_알고리즘] 10815 숫자 카드

import java.util.HashMap;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        HashMap<Integer, Integer> hashmap = new HashMap<>();
        StringBuffer stringBuffer = new StringBuffer();
        
        int numN = 0; int numM = 0;
        int N = scanner.nextInt();

        for (int i = 0; i < N; i++) {
            numN = scanner.nextInt();
            hashmap.put(numN, i);
        }

        int M = scanner.nextInt();
        for (int i = 0; i < M; i++) {
        	numM = scanner.nextInt();
        	if(hashmap.containsKey(numM)){
        		stringBuffer.append(1+" ");
        	}
        	else
        		stringBuffer.append(0+" ");
        }
        System.out.println(stringBuffer);
        scanner.close();
    }
}

HashMap과 StringBuffer를 이용했다.

StringBuffer는 출력이 간편하다