不断地循环左移与n的第32-i相与,若为一那么说明n的这一位为1,否则为0
class Solution {
public:
int hammingWeight(uint32_t n)
{
int res = 0;
for (int i = 0; i < 32; i++)
{
if (n & (1 << i))
{
res++;
}
}
return res;
}
};