leetcode_191_Number of 1 Bits(easy)(C++)

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=1101，n&(n-1) = 1100

重复n&(n-1) = 1000

重复n&(n-1) = 1000

重复n&(n-1) = 0000

总共有三个1，得到0x0时，循环走了三次。（类型题可以查看Power  of  Two）

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