< Summary

Information
Class: LeetCode.Algorithms.NumberOfOneBits.NumberOfOneBitsLookup
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfOneBits\NumberOfOneBitsLookup.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 48
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
.cctor()100%44100%
HammingWeight(...)100%11100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfOneBits\NumberOfOneBitsLookup.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.NumberOfOneBits;
 13
 14/// <inheritdoc />
 15public class NumberOfOneBitsLookup : INumberOfOneBits
 16{
 117    private static readonly int[] WordBits = new int[65536];
 18
 19    static NumberOfOneBitsLookup()
 120    {
 21        uint i;
 22
 13107423        for (i = 0; i <= 0xFFFF; i++)
 6553624        {
 6553625            var x = i;
 26
 27            int count;
 28
 117964829            for (count = 0; x > 0; count++)
 52428830            {
 52428831                x &= x - 1;
 52428832            }
 33
 6553634            WordBits[i] = count;
 6553635        }
 136    }
 37
 38    /// <summary>
 39    ///     Time complexity - O(1)
 40    ///     Space complexity - O(1)
 41    /// </summary>
 42    /// <param name="n"></param>
 43    /// <returns></returns>
 44    public int HammingWeight(int n)
 345    {
 346        return WordBits[n & 0xFFFF] + WordBits[(n >> 16) & 0xFFFF];
 347    }
 48}