< Summary

Information
Class: LeetCode.Algorithms.FindTheNumberOfDistinctColorsAmongTheBalls.FindTheNumberOfDistinctColorsAmongTheBallsDictionary
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindTheNumberOfDistinctColorsAmongTheBalls\FindTheNumberOfDistinctColorsAmongTheBallsDictionary.cs
Line coverage
100%
Covered lines: 25
Uncovered lines: 0
Coverable lines: 25
Total lines: 57
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
QueryResults(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindTheNumberOfDistinctColorsAmongTheBalls\FindTheNumberOfDistinctColorsAmongTheBallsDictionary.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.FindTheNumberOfDistinctColorsAmongTheBalls;
 13
 14/// <inheritdoc />
 15public class FindTheNumberOfDistinctColorsAmongTheBallsDictionary : IFindTheNumberOfDistinctColorsAmongTheBalls
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="limit"></param>
 22    /// <param name="queries"></param>
 23    /// <returns></returns>
 24    public int[] QueryResults(int limit, int[][] queries)
 225    {
 226        var result = new int[queries.Length];
 227        var colorMap = new Dictionary<int, int>();
 228        var ballMap = new Dictionary<int, int>();
 29
 2230        for (var i = 0; i < queries.Length; i++)
 931        {
 932            var ball = queries[i][0];
 933            var color = queries[i][1];
 34
 935            if (ballMap.TryGetValue(ball, out var prevColor))
 136            {
 137                colorMap[prevColor]--;
 38
 139                if (colorMap[prevColor] == 0)
 140                {
 141                    colorMap.Remove(prevColor);
 142                }
 143            }
 44
 945            ballMap[ball] = color;
 46
 947            if (!colorMap.TryAdd(color, 1))
 148            {
 149                colorMap[color]++;
 150            }
 51
 952            result[i] = colorMap.Count;
 953        }
 54
 255        return result;
 256    }
 57}