Algorithm
Birthday Cake Candles
후니우니
2020. 10. 10. 17:24
반응형
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'birthdayCakeCandles' function below.
*
* The function is expected to return an INTEGER.
* The function accepts INTEGER_ARRAY candles as parameter.
*/
public static int birthdayCakeCandles(List<Integer> candles) {
// Write your code here
int tallestCandle = candles.get(0);
int count = 0;
for (int candle: candles) {
if (candle > tallestCandle)
tallestCandle = candle;
}
for (int candle: candles) {
if (candle == tallestCandle)
count ++;
}
return count;
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int candlesCount = Integer.parseInt(bufferedReader.readLine().trim());
List<Integer> candles = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
int result = Result.birthdayCakeCandles(candles);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedReader.close();
bufferedWriter.close();
}
}
입력받은 값 중에서 제일 큰값을 구하고 해당 하는 값과 동일한 값의 갯수를 카운팅하여 리턴하는 문제
문제출처 : www.hackerrank.com
반응형