Minimum Rounds to Complete All Task

[개발뉴비(coderhs)]

https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/

class Solution:

    def minimumRounds(self, tasks: List[int]) -> int:

        cnt = Counter(tasks)

        ans = 0

        for num in cnt:

            if cnt[num] == 1 :

                return -1

            ans += (cnt[num] + 2) // 3

        return ans

이제는 그냥 생각없이 Counter (from collections)...

세상을 날로 먹고 싶다