Advertisement
2410. Maximum Matching of Players With Trainers
MediumView on LeetCode
2410.cs
C#
public class Solution
{
public int MatchPlayersAndTrainers(int[] players, int[] trainers)
{
int ans = 0;
Array.Sort(players);
Array.Sort(trainers);
for (int i = 0; i < trainers.Length; ++i)
{
if (players[ans] <= trainers[i] && ++ans == players.Length)
return ans;
}
return ans;
}
}Advertisement
Was this solution helpful?