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.
Code
#include<iostream>
using namespace std;
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while (n != 0) {
count++;
n = (n - 1)&n;
}
return count;
}
};
int main() {
Solution so;
uint32_t n=11;
cout<<so.hammingWeight(n)<<endl;
system("pause");
return 0;
}