[BOJ] 2776: 암기왕 (JAVA)

2776번: 암기왕

 

틀린 이유

 

테스트케이스가 여러 개 있을 수 있기 때문에,

list에 계속 쌓이는 숫자들을 초기화해줬어야 했는데 이를 간과했다..!

 

package 백준renew;

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

public class 실버4_2776_암기왕 {
	static List<Integer> list = new ArrayList<>();
	static int ans;
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		StringBuilder sb = new StringBuilder();
		
		int T = Integer.parseInt(br.readLine());
		
		for(int tc=0; tc<T; tc++) {
			list.clear();
			
			int M = Integer.parseInt(br.readLine());
			StringTokenizer st = new StringTokenizer(br.readLine());
			for(int i=0; i<M; i++) {
				list.add(Integer.parseInt(st.nextToken()));
			}
			
			Collections.sort(list);	
			
			int N = Integer.parseInt(br.readLine());
			st = new StringTokenizer(br.readLine());
			for(int i=0; i<N; i++) {
				ans = 0;
				int now = Integer.parseInt(st.nextToken());
				Check(now, 0, M-1);
				sb.append(ans).append('\n');
			}
		}
		bw.write(sb.toString());
		bw.flush();
		bw.close();
	}
	static void Check(int key, int low, int high) {
		while(true) {
			if(low<=high) {
				int mid = (low + high)/2;
				if(key == list.get(mid)) {
					ans = 1;
					return;
				}else if(key < list.get(mid)) {
					high = mid-1;
				}else {
					low = mid+1;
				}
			}else {
				ans = 0;
				return;
			}
		}
	}
}