LeetCode 191. Number of 1 Bits

191. Number of 1 Bits

Description

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.

Solution

• 题意即判断一个unsigned int类型的整数二进制位中有多少个1.
• 我们可以利用%2来获得最后一位，用/2来舍掉最后一位，从而统计出来。代码如下：

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int rnt = 0;
        while (n) {
            rnt += n % 2;
            n /= 2;
        }
        return rnt;
    }
};