-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path부품 찾기.java
46 lines (41 loc) · 993 Bytes
/
부품 찾기.java
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
import java.util.*;
public class Main{
public static int binary_search(int[] array,int target,int start,int end){
if(start>end){
return -1;
}
int mid = (start+end) / 2;
if(target == array[mid]){
return mid;
}
else if(target < array[mid]){
return binary_search(array, target, start, mid-1);
}
else{
return binary_search(array, target, mid+1, end);
}
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
for(int i=0;i<n;i++){
arr[i] = sc.nextInt();
}
int target = sc.nextInt();
int[] arr2 = new int[target];
for(int i =0;i<target;i++){
arr2[i] = sc.nextInt();
}
Arrays.sort(arr);
for(int i =0;i<target;i++){
int result = binary_search(arr,arr2[i],0,n);
if(result == -1){
System.out.print("no ");
}
else{
System.out.print("yes ");
}
}
}
}