1189. Maximum Number of Balloons Обновлено: 2024-03-12 1 мин Algorithms , LeetCode СодержаниеLeetCode problem 1189class Solution: def maxNumberOfBalloons(self, text: str) -> int: cnt = Counter(text) cnt['o'] >>= 1 cnt['l'] >>= 1 return min(cnt[c] for c in 'balon')