Pada postingan saya kali ini akan membahas materi yang ada di HackerRank pada problem “Birthday Cake Candles” (baca disini).
Solution
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 Solution { // Complete the birthdayCakeCandles function below. static int birthdayCakeCandles(int[] ar) { //mengurutkan array Arrays.sort(ar); //mendapatkan nilai array terbesar int big = ar[ar.length-1]; int count = 0; //menghitung jumlah array terbesar for(int i = 0; i < ar.length; i++){ if(ar[i] == big){ count = count + 1; } } return count; } 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(); } }
Selamat mencoba 🙂