< Summary

Information
Class: LeetCode.Algorithms.MaximumNumberOfIntegersToChooseFromRange1.MaximumNumberOfIntegersToChooseFromRange1HashSet
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumNumberOfIntegersToChooseFromRange1\MaximumNumberOfIntegersToChooseFromRange1HashSet.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 51
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaxCount(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumNumberOfIntegersToChooseFromRange1\MaximumNumberOfIntegersToChooseFromRange1HashSet.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.MaximumNumberOfIntegersToChooseFromRange1;
 13
 14/// <inheritdoc />
 15public class MaximumNumberOfIntegersToChooseFromRange1HashSet : IMaximumNumberOfIntegersToChooseFromRange1
 16{
 17    /// <summary>
 18    ///     Time complexity - O(m + n)
 19    ///     Space complexity - O(m)
 20    /// </summary>
 21    /// <param name="banned"></param>
 22    /// <param name="n"></param>
 23    /// <param name="maxSum"></param>
 24    /// <returns></returns>
 25    public int MaxCount(int[] banned, int n, int maxSum)
 326    {
 327        var result = 0;
 328        var sum = 0;
 29
 330        var bannedHashSet = new HashSet<int>(banned);
 31
 4032        for (var i = 1; i <= n; i++)
 1933        {
 1934            if (bannedHashSet.Contains(i))
 835            {
 836                continue;
 37            }
 38
 1139            sum += i;
 40
 1141            if (sum > maxSum)
 242            {
 243                break;
 44            }
 45
 946            result++;
 947        }
 48
 349        return result;
 350    }
 51}