tsanmmmm2000's Tech Blog

Question

Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).

For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.

My C# Solution

public class Solution {
    public int HammingWeight(uint n) {
        var result = 0;
        for(var i = 0; i < 32; i++)
        {
            if ((n & 1) == 1) result++;
            n = n >> 1;
        }
        return result;
    }
}