思路:用位运算来做,与1,第一位保持不变,前面的置0,然后判断,再右移
class Solution {
public:
int NumberOf1(int n) {
int i = 0;
int count = 0;
for(i = 0;i < 32;i++)
{
if((n&1) == 1)
count++;
n = n>>1;
}
return count;
}
};