forked from alexprut/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
33 lines (30 loc) · 822 Bytes
/
Solution.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
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
static int birthdayCakeCandles(int n, int[] ar) {
int max = 1;
int counter = 0;
for (int i = 0; i < ar.length; i++) {
if (max < ar[i]) {
max = ar[i];
counter = 1;
} else if (max == ar[i]) {
counter++;
}
}
return counter;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] ar = new int[n];
for(int ar_i = 0; ar_i < n; ar_i++){
ar[ar_i] = in.nextInt();
}
int result = birthdayCakeCandles(n, ar);
System.out.println(result);
}
}