-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBirthdayCakeCandles.java
More file actions
69 lines (48 loc) · 1.69 KB
/
Copy pathBirthdayCakeCandles.java
File metadata and controls
69 lines (48 loc) · 1.69 KB
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
69
package com.HackerRank;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
public class BirthdayCakeCandles {
/*
* Hacker Rank Algorithm Question - Birthday Cake Candles Solution
*
* Solved Date : 2019-07-28
* Author : TK Lee
*
* Source : https://www.hackerrank.com/challenges/birthday-cake-candles/problem
*/
// Complete the birthdayCakeCandles function below.
static int birthdayCakeCandles(int[] ar) {
int maxNum = 0;
int numCnt = 0;
for (int i = 0; i < ar.length; i++) {
if (maxNum == ar[i]) {
numCnt++;
} else if (maxNum < ar[i]) {
//If Max Number gets changed, rest count.
numCnt = 1;
maxNum = ar[i];
}
}
return numCnt;
}
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 arCount = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] ar = new int[arCount];
String[] arItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < arCount; i++) {
int arItem = Integer.parseInt(arItems[i]);
ar[i] = arItem;
}
int result = birthdayCakeCandles(ar);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}