[백준] 숫자 카드 10815 - JAVA

문제

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

10815번: 숫자 카드

 

풀이

import java.util.*;
import java.io.*;

public class Main {
	
	public static void main(String args[]) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		StringBuilder sb = new StringBuilder();
		
		int n = Integer.parseInt(br.readLine());
		
		int arr [] = new int[n];
		
		st = new StringTokenizer(br.readLine());
		for(int i=0;i<n;i++) {
			int num = Integer.parseInt(st.nextToken());
			
			arr[i] = num;
		}
		
		Arrays.sort(arr);
		
		int m = Integer.parseInt(br.readLine());
		
		st = new StringTokenizer(br.readLine());
		for(int i=0;i<m;i++) {
			int num = Integer.parseInt(st.nextToken());
			sb.append(find(arr, num)+" ");
		}
       
		System.out.print(sb);
	}
   
	
	static int find(int arr[], int key) {
		int l = 0;
		int r = arr.length;
		
		while(l<r) {
			int mid = (l+r)/2;
			
			if(key == arr[mid])
				return 1;
			if(key < arr[mid]) {
				r = mid;
			}
			else {
				l = mid+1;
			}
		}
		return 0;
	}
	
   
}