Way1. Set 사용

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

public class Main {
  public static void main(String[] args) throws IOException {
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      int N = Integer.parseInt(br.readLine());
      String[] myCardString = br.readLine().split(" ");

      // Set 사용
      Set<Integer> myCards = new HashSet<>();
      for (int i = 0; i < N; i++) {
          myCards.add(Integer.parseInt(myCardString[i]));
      }

      int M = Integer.parseInt(br.readLine());
      String[] targetCards = br.readLine().split(" ");

      StringBuilder answer = new StringBuilder();

      for (int i = 0; i < M; i++) {
        int result = myCards.contains(Integer.parseInt(targetCards[i])) ? 1 : 0;
        answer.append(result).append(" ");
      }

      System.out.println(answer);
  }
}

Way2. 이진 탐색 알고리즘 사용

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) throws IOException {
        new Main().solution();
    }

    public void solution() throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(br.readLine());
        String[] myCardString = br.readLine().split(" ");

        int M = Integer.parseInt(br.readLine());
        String[] inCards = br.readLine().split( " ");
        br.close();

        // 이진 탐색
        int[] myCards = new int[N];
        for (int i = 0; i < N; i++) {
            myCards[i] = Integer.parseInt(myCardString[i]);
        }

        Arrays.sort(myCards);

        StringBuilder answer = new StringBuilder();
        for (String str : inCards) {
            int result = binarySearch(myCards, Integer.parseInt(str)) ? 1 : 0;
            answer.append(result).append(" ");
        }

        System.out.println(answer);
    }

  // 이진탐색 메소드
    public boolean binarySearch(int[] arr, int target) {
      int low = 0;
      int high = arr.length -1;

      while (low <= high) {
          int mid = low + (high - low) / 2;

          if (arr[mid] == target) return true;
          else if (arr[mid] < target) {
              low = mid + 1;
          } else {
              high = mid - 1;
          }
      }

      return false;
    }
}