class Solution { public: int NumberOf1(int n) { int cnt = 0; for (int i = 0; i < 32; i ++ ) if (n >> i & 1 == 1) //取n的第k位二进制数 cnt ++ ; return cnt; } };