链接：https://leetcode.com/problems/number-of-1-bits/
此题关键是如何判断一个数字的第i为是否为0 即： x& (1<<i)
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
for(int i = 0; i < 32; i++){
if((n & (1<<i)) != 0)count++;
}
return count;
}
};原文：http://blog.csdn.net/lu597203933/article/details/44811049