标签：important back etc ++ repeat bsp min ack round
int hammingWeight(uint32_t n) { int count=0; while(n) { if(n & 1) count++; n >>= 1; } return count; }
【leetcode】位1的个数
原文地址：https://www.cnblogs.com/ganxiang/p/13672427.html
