Class Solution
-
- All Implemented Interfaces:
public final class Solution3238 - Find the Number of Winning Players\.
Easy
You are given an integer
nrepresenting the number of players in a game and a 2D arraypickwhere <code>picki = x<sub>i</sub>, y<sub>i</sub></code> represents that the player <code>x<sub>i</sub></code> picked a ball of color <code>y<sub>i</sub></code>.Player
iwins the game if they pick strictly more thaniballs of the same color. In other words,Player 0 wins if they pick any ball.
Player 1 wins if they pick at least two balls of the same color.
...
Player
iwins if they pick at leasti + 1balls of the same color.
Return the number of players who win the game.
Note that multiple players can win the game.
Example 1:
Input: n = 4, pick = \[\[0,0],1,0,1,0,2,1,2,1,2,0]
Output: 2
Explanation:
Player 0 and player 1 win the game, while players 2 and 3 do not win.
Example 2:
Input: n = 5, pick = \[\[1,1],1,2,1,3,1,4]
Output: 0
Explanation:
No player wins the game.
Example 3:
Input: n = 5, pick = \[\[1,1],2,4,2,4,2,4]
Output: 1
Explanation:
Player 2 wins the game by picking 3 balls with color 4.
Constraints:
2 <= n <= 101 <= pick.length <= 100pick[i].length == 2<code>0 <= x<sub>i</sub><= n - 1</code>
<code>0 <= y<sub>i</sub><= 10</code>