leetcode 191. number of 1 bits

leetcode 191. Number of 1 Bits

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.

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int cnt = 0;

        while (n != 0) 
        {
            n = n&(n-1);
            cnt++;
        }

        return cnt;
    }
};

n = n&(n-1)，一直循环，循环的次数即总共有多少个1

其实也很简单，因为每进行这么一次操作就会减少一个1