LeetCode191—Number of 1 Bits

原题

原题链接

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.

分析

统计二进制数里面的1的个数，很简单，就迭代一次，统计即可。

代码

class Solution {
public:
int hammingWeight(uint32_t n) {
int count=0;
for(int i=0;i<32;++i)
{
if (n&1==1)
++count;
n>>=1;
}
return count;
}
};