-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathBreakingTheRecords.java
40 lines (34 loc) · 1.13 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
// https://www.hackerrank.com/challenges/breaking-best-and-worst-records/problem
package implimentation;
import java.util.Scanner;
public class BreakingTheRecords {
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) {
int length = scanner.nextInt();
int[] scores = getArray(length);
printMinMax(scores);
}
private static int[] getArray(int length) {
int[] array = new int[length];
for (int index = 0 ; index < array.length ; index++) {
array[index] = scanner.nextInt();
}
return array;
}
private static void printMinMax(int[] array) {
int min = array[0];
int max = array[0];
int maximumRecordBroke = 0;
int minimumRecordBroke = 0;
for (int number : array) {
if (number > max) {
max = number;
maximumRecordBroke++;
} else if (number < min) {
min = number;
minimumRecordBroke++;
}
}
System.out.println(maximumRecordBroke + " " + minimumRecordBroke);
}
}