< Summary

Information
Class: LeetCode.Algorithms.MaximumMatchingOfPlayersWithTrainers.MaximumMatchingOfPlayersWithTrainersSorting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumMatchingOfPlayersWithTrainers\MaximumMatchingOfPlayersWithTrainersSorting.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 44
Line coverage: 100%
Branch coverage
83%
Covered branches: 5
Total branches: 6
Branch coverage: 83.3%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MatchPlayersAndTrainers(...)83.33%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumMatchingOfPlayersWithTrainers\MaximumMatchingOfPlayersWithTrainersSorting.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.MaximumMatchingOfPlayersWithTrainers;
 13
 14/// <inheritdoc />
 15public class MaximumMatchingOfPlayersWithTrainersSorting : IMaximumMatchingOfPlayersWithTrainers
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n + m log m)
 19    ///     Space complexity - O(log n + log m)
 20    /// </summary>
 21    /// <param name="players"></param>
 22    /// <param name="trainers"></param>
 23    /// <returns></returns>
 24    public int MatchPlayersAndTrainers(int[] players, int[] trainers)
 225    {
 226        Array.Sort(players);
 227        Array.Sort(trainers);
 28
 229        var playersIndex = 0;
 230        var trainersIndex = 0;
 31
 732        while (playersIndex < players.Length && trainersIndex < trainers.Length)
 533        {
 534            if (players[playersIndex] <= trainers[trainersIndex])
 335            {
 336                playersIndex++;
 337            }
 38
 539            trainersIndex++;
 540        }
 41
 242        return playersIndex;
 243    }
 44}