< Summary

Information
Class: LeetCode.Algorithms.KeepMultiplyingFoundValuesByTwo.KeepMultiplyingFoundValuesByTwoBitArrayLookup
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\KeepMultiplyingFoundValuesByTwo\KeepMultiplyingFoundValuesByTwoBitArrayLookup.cs
Line coverage
100%
Covered lines: 13
Uncovered lines: 0
Coverable lines: 13
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
FindFinalValue(...)83.33%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\KeepMultiplyingFoundValuesByTwo\KeepMultiplyingFoundValuesByTwoBitArrayLookup.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 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
 12using System.Collections;
 13
 14namespace LeetCode.Algorithms.KeepMultiplyingFoundValuesByTwo;
 15
 16/// <inheritdoc />
 17public sealed class KeepMultiplyingFoundValuesByTwoBitArrayLookup : KeepMultiplyingFoundValuesByTwoBase
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(1)
 22    /// </summary>
 23    /// <param name="nums"></param>
 24    /// <param name="original"></param>
 25    /// <returns></returns>
 26    public override int FindFinalValue(int[] nums, int original)
 227    {
 228        var numsLookup = new BitArray(MaxNum + 1);
 29
 2030        for (var i = 0; i < nums.Length; i++)
 831        {
 832            var num = nums[i];
 33
 834            numsLookup[num] = true;
 835        }
 36
 537        while (original <= MaxNum && numsLookup[original])
 338        {
 339            original *= 2;
 340        }
 41
 242        return original;
 243    }
 44}