leetcode+ 求二进制1的个数，位操作

点击打开链接 class Solution { public: int hammingWeight(uint32_t n) { if(n==0) return 0; int i=0, sum=0; while(i<32){ if(n&(1<<i)) sum+=1; i+=1; } return sum; } };