191. Number of 1 Bits
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.
Solution
运用移位运算符, 将输入与1按位与,判断最低位是否为1,接着将输入左移一位,重复以上判断,直至输入为0. 最后可统计得位为1的个数。
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while(n != 0){
if(n&1 == 1){
++count;
}
n = n >> 1;
}
return count;
}
};