< Summary

Information
Class: LeetCode.Algorithms.RelativeRanks.RelativeRanksTuple
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RelativeRanks\RelativeRanksTuple.cs
Line coverage
100%
Covered lines: 20
Uncovered lines: 0
Coverable lines: 20
Total lines: 49
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
FindRelativeRanks(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RelativeRanks\RelativeRanksTuple.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.RelativeRanks;
 13
 14/// <inheritdoc />
 15public class RelativeRanksTuple : IRelativeRanks
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="score"></param>
 22    /// <returns></returns>
 23    public string[] FindRelativeRanks(int[] score)
 224    {
 225        var result = new string[score.Length];
 26
 227        (int index, int score)[] tuples = new (int, int)[score.Length];
 28
 2429        for (var i = 0; i < score.Length; i++)
 1030        {
 1031            tuples[i] = (i, score[i]);
 1032        }
 33
 1434        Array.Sort(tuples, (a, b) => b.score.CompareTo(a.score));
 35
 2436        for (var i = 0; i < tuples.Length; i++)
 1037        {
 1038            result[tuples[i].index] = i switch
 1039            {
 240                0 => "Gold Medal",
 241                1 => "Silver Medal",
 242                2 => "Bronze Medal",
 443                _ => (i + 1).ToString()
 1044            };
 1045        }
 46
 247        return result;
 248    }
 49}