-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLinearSearch.java
56 lines (39 loc) · 1.3 KB
/
LinearSearch.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
47
48
49
50
51
52
53
54
55
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
public class Solution {
/*
* Complete the findNumber function below.
*/
static String findNumber(int[] arr, int k) {
/*
* Write your code here.
*/
boolean found = Arrays.stream(arr).anyMatch(x -> x == k);
if(found)
return "YES";
else
return "NO";
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int arrCount = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])*");
int[] arr = new int[arrCount];
for (int arrItr = 0; arrItr < arrCount; arrItr++) {
int arrItem = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])*");
arr[arrItr] = arrItem;
}
int k = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])*");
String res = findNumber(arr, k);
bufferedWriter.write(res);
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}