class Solution { public: int NumberOf1(int n) { int a = 1; int nums = 0; while (a != 0) { if (n == (n | a)) nums++; a <<= 1; } return nums; } };
[剑指offer] 11. 二进制中1的个数
原文：https://www.cnblogs.com/ruoh3kou/p/10049152.html
