Code IT/Algorithm
[프로그래머스] 기능개발 (Python)
찾
2022. 3. 13. 16:55
from collections import Counter
def solution(progresses, speeds):
days = []
for p,s in zip(progresses,speeds):
spend = ((100-p)//s if (100-p)%s == 0 else (100-p)//s+1)
if days and days[-1] > spend:
days.append(days[-1])
else:
days.append(spend)
return [x[1] for x in sorted(Counter(days).items())]
빠르게 풀었다