[스파르타] 99클럽 2기 코테스터디 39일차 TIL / leet 1338

Leetcode: 1338. Reduce Array Size to The Half (링크)

1338. Reduce Array Size to The Half

 

 

class Solution:
    def minSetSize(self, arr: List[int]) -> int:
        arr_length= len(arr)
        target = len(arr) // 2
        cnt = 0

        counter_arr = collections.Counter(arr)
        frequency = sorted(counter_arr.values())

        while arr_length > target:
            arr_length -= frequency.pop()
            cnt += 1

        return cnt

오늘 미들러 풀이 끝!

---

참고한 블로그: https://velog.io/@minu/LeetCode-1338.-Reduce-Array-Size-to-The-Half