题目:
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.
分析:
求32位无符号数的1的个数,那么一个一个数就可以了。
代码:
class Solution {
public:
int hammingWeight(uint32_t n) {
int res=0;
while(n){
if(n%2)res++;
n>>=1;
}
return res;
}
};