[PS][java][BinarySearch]/[수 찾기]/O(n)

boj-java-1920-n.java

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

public class Main{
    static int n,m;
    static int[] arr, find;
    static int ans=0;
    static boolean exist(int next){
        for(int i=0; i<n; i++){
            if(arr[i] == next){
                return true;
            }
        }
        return false;
    }
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        n = Integer.parseInt(br.readLine());
        String[] str = br.readLine().split(" ");
        arr = new int[n];
        for(int i=0; i<n; i++){
            arr[i] = Integer.parseInt(str[i]);
        }
        m = Integer.parseInt(br.readLine());
        String[] str2 = br.readLine().split(" ");
        find = new int[m];
        for(int i=0; i<m; i++){
            find[i] = Integer.parseInt(str2[i]);
        }
        for(int i=0; i<m; i++){
            int next = find[i];
            if(exist(next)){
                System.out.println(1);
            }else{
                System.out.println(0);
            }
        }
    }
}