-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathBreakingTheRecords.java
68 lines (52 loc) · 1.78 KB
/
BreakingTheRecords.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
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class BreakingTheRecords {
// https://www.hackerrank.com/challenges/breaking-best-and-worst-records/problem
// Complete the breakingRecords function below.
static int[] breakingRecords(int[] scores) {
int highScore = scores[0];
int lowScore = scores[0];
int hCount = 0;
int lCount = 0;
for (int sc : scores) {
if(sc>highScore) {
highScore=sc;
hCount++;
}
if(sc<lowScore) {
lowScore = sc;
lCount++;
}
}
int[] ar = {hCount,lCount};
return ar;
}
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 n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] scores = new int[n];
String[] scoresItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int scoresItem = Integer.parseInt(scoresItems[i]);
scores[i] = scoresItem;
}
int[] result = breakingRecords(scores);
for (int i = 0; i < result.length; i++) {
bufferedWriter.write(String.valueOf(result[i]));
if (i != result.length - 1) {
bufferedWriter.write(" ");
}
}
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}