[백준/JAVA] 10815번 : 숫자카드

📖  문제 링크

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

10815번: 숫자 카드

 

 

✅  제출 코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.StringTokenizer;


public class Main {	//최소 여행비용 구하기

	static int N, M;
	static List<Integer> card;					//같은 숫자는 없음 
	static List<Integer> checkNum;
	static boolean isNum;
	
	
	public static void main(String[] args) throws Exception{				

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		StringTokenizer st = null;
		N = Integer.parseInt(br.readLine());
		card = new ArrayList<Integer>();
		
		//상근이 카드 
		st = new StringTokenizer(br.readLine());
		for(int i=0;i<N;i++) {
			card.add(Integer.parseInt(st.nextToken()));
		}
		
		//확인해야할 숫자
		M = Integer.parseInt(br.readLine());
		checkNum = new ArrayList<Integer>();
		
		st = new StringTokenizer(br.readLine());
		for(int i=0;i<M;i++) {
			checkNum.add(Integer.parseInt(st.nextToken()));
		}
		
		
		Collections.sort(card);			//상근이가 갖고있는 카드는 정렬	
		
		for(int i=0;i<M;i++) {
			isNum = false;
			binarySearch(checkNum.get(i), 0, N);
			if(isNum) bw.write(1 + " ");
			else	bw.write(0 + " ");
		}
		
		
		bw.flush();
		bw.close();
		
	
	}//main	
	
	
	
	public static void binarySearch(int num, int start, int end) {
		
		
		if(start == end) return;
		
		int mid = (start+end)/2;
		
		if(num == card.get(mid)) {
			isNum = true;
			return;
		}	
		
		if(num > card.get(mid)) {
			binarySearch(num, mid+1, end);
		}
		else {
			binarySearch(num, start, mid);			
		}
		
				
	}//binarySearch
	
}//end class