class Solution { public: int NumberOf1(int n) { int count = 0; unsigned int flag = 1; while (flag) { if (n & flag) count++; flag = flag << 1; } return count; } };
剑指offer---二进制中1的个数
原文：http://www.cnblogs.com/159269lzm/p/7294183.html
