93. Number of 1 Bits

-191. Number of 1 Bits My Submissions QuestionEditorial Solution
Total Accepted: 93052 Total Submissions: 247813 Difficulty: Easy
Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).

For example, the 32-bit integer ’11’ has binary representation 00000000000000000000000000001011, so the function should return 3.

题意：返回整数n的二进制位数
解法1.注意到n&n-1是让n最右边的1变为0
不信你试几个，
解法2.还有通过移位实现的，注意
如果是负数向右移位是有问题的
所以尽量每次用左移一位，判断最后一位和1与的结果
判断0或1

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int count=0;
        while(n){
            n=n&(n-1);
            count++;
        }
        return count;
    }
};