class Solution { public: int NumberOf1(int n) { int count=0; while(n) { count++; n=n&(n-1);//二进制最右边一个1变为0 } return count; } };