[프로그래머스 코딩테스트 연습] 귤 고르기 (Python3)

https://school.programmers.co.kr/learn/courses/30/lessons/138476

 

def solution(k, tangerine):
    answer = 0
    for _, cnt in Counter(tangerine).most_common():
        k -= cnt
        answer += 1
        if k <= 0: return answer

# 리팩토링
from collections import Counter
def solution(k, tangerine):
    for i, cnt in enumerate(sorted(Counter(tangerine).values(), reverse=True)):
        k -= cnt
        if k <= 0: return i+1

속도는 리팩한게 더 빠른거 같긴한데

most_common() 유용하다