[백준][Java] 1920번 수 찾기 (이진 탐색)

[백준][Java] 1920번 수 찾기 (이진 탐색)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65

import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.Arrays; public class Main { private static BufferedReader br = new BufferedReader( new InputStreamReader( System . in )); private static BufferedWriter bw = new BufferedWriter( new OutputStreamWriter( System . out )); public static boolean isExist( int [] numArr, int X) { int left = 0 ; int right = numArr. length - 1 ; int mid = 0 ; while (left < = right) { mid = (left + right) / 2 ; if (numArr[mid] < X) left = mid + 1 ; else if (numArr[mid] > X) right = mid - 1 ; else return true ; } return false ; } public static void main( String [] args) throws IOException{ int N = stoi(br.readLine()); int [] numArr = new int [N]; String [] str = br.readLine(). split ( " " ); for ( int i = 0 ; i < N; i + + ) numArr[i] = stoi(str[i]); Arrays.sort(numArr); int M = stoi(br.readLine()); str = br.readLine(). split ( " " ); StringBuilder sb = new StringBuilder(); for ( int i = 0 ; i < M; i + + ) { if ( isExist(numArr, stoi(str[i])) ) sb.append( "1

" ); else sb.append( "0

" ); } System . out . println (sb. toString ()); // bw.write(""); // bw.flush(); // bw.close(); } private static int stoi( String input) { return Integer. parseInt (input); } } Colored by Color Scripter

from http://aig2029.tistory.com/339 by ccl(A) rewrite - 2021-10-14 05:28:06