LeetCode 第 191 题 (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.

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

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120