发表于 2024.08.09

• 每个玩家都用一个哈希表记录每个颜色的次数，如果次数大于等于2就将其加入胜利玩家的集合(set)中。最后返回集合的长度即可。

  class Solution:
      def winningPlayerCount(self, n: int, pick: List[List[int]]) -> int:
          cnt_map = [defaultdict(int) for _ in range(n)]
          winners = set()
          for user, color in pick:
              cnt_map[user][color] += 1
              if cnt_map[user][color] > user and user not in winners:
                  winners.add(user)
          return len(winners)

• LC 题目链接