[백준] - #1920: 수 찾기

문제 출처 : https://www.acmicpc.net/

 

---

#1920: 수 찾기 (언어 : Java11)

---

제출 답안

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

public class Main {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer stk;
		
		int[] arr = new int[Integer.parseInt(br.readLine())];
		stk = new StringTokenizer(br.readLine());
		
		for(int i=0; i<arr.length; i++) {
			arr[i] = Integer.parseInt(stk.nextToken());
		}
		Arrays.sort(arr);
		
		int interval = Integer.parseInt(br.readLine());
		stk = new StringTokenizer(br.readLine());
		
		for(int i=0; i<interval; i++) {
			int num = Integer.parseInt(stk.nextToken());
			int start = 0;
			int end = arr.length-1;
			boolean contain = false;
			while(start<=end) {
				int idx = (start+end)/2;
				
				if(arr[idx]<num) {
					start = idx + 1;
				}
				else if(arr[idx]>num) {
					end = idx - 1;
				}
				else if(arr[idx]==num) {
					contain = true;
					break;
				}
			}
			
			if(contain)
				System.out.println(1);
			else
				System.out.println(0);
		}
        br.close();
	}
}

---

comment

-