일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Baekjoon
- 맥북
- dacon
- Docker
- Real or Not? NLP with Disaster Tweets
- 프로그래머스
- 편스토랑 우승상품
- 코로나19
- leetcode
- programmers
- 캐치카페
- 데이콘
- 편스토랑
- 프로그래머스 파이썬
- Kaggle
- ChatGPT
- PYTHON
- SW Expert Academy
- 자연어처리
- 우분투
- hackerrank
- 백준
- 파이썬
- AI 경진대회
- ubuntu
- github
- 금융문자분석경진대회
- Git
- gs25
- 더현대서울 맛집
- Today
- Total
솜씨좋은장씨
[HackerRank] Birthday Cake Candles (Python) 본문
You are in charge of the cake for your niece's birthday and have decided the cake will have one candle for each year of her total age. When she blows out the candles, she’ll only be able to blow out the tallest ones. Your task is to find out how many candles she can successfully blow out.
For example, if your niece is turning 4 years old, and the cake will have 4 candles of height 4, 4, 1, 3, she will be able to blow out 2 candles successfully, since the tallest candles are of height 4 and there are 2 such candles.
Function Description
Complete the function birthdayCakeCandles in the editor below. It must return an integer representing the number of candles she can blow out.
birthdayCakeCandles has the following parameter(s):
- ar: an array of integers representing candle heights
Input Format
The first line contains a single integer, n, denoting the number of candles on the cake.
The second line contains n space-separated integers, where each integer i describes the height of candle i.
Constraints
- 1 <= n <= 10^5
- 1 <= ar[ i ] <= 10^7
Output Format
Return the number of candles that can be blown out on a new line.
Sample Input 0
4
3 2 1 3
Sample Output 0
2
Explanation 0
We have one candle of height 1, one candle of height 2, and two candles of height 3. Your niece only blows out the tallest candles, meaning the candles where height = 3. Because there are 2 such candles, we print 2 on a new line.
Solution
#!/bin/python3
import math
import os
import random
import re
import sys
import collections
# Complete the birthdayCakeCandles function below.
def birthdayCakeCandles(ar):
my_candles_counter = collections.Counter(ar)
max_height = max(my_candles_counter.keys())
return my_candles_counter[max_height]
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
ar_count = int(input())
ar = list(map(int, input().rstrip().split()))
result = birthdayCakeCandles(ar)
fptr.write(str(result) + '\n')
fptr.close()
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[Programmers] 힙 : 더 맵게 (Python) (0) | 2020.04.06 |
---|---|
[HackerRank] Time Conversion (Python) (0) | 2020.04.05 |
[HackerRank] Stack and Queues : A Tale of Two Stacks (0) | 2020.04.04 |
[HackerRank] Min-Max Sum (Python) (0) | 2020.04.03 |
[HackerRank] Staircase (Python) (0) | 2020.04.02 |