[LeetCode] 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.

解题思路1

每一位分别和1进行与运算，统计结果不为0的位数。

实现代码1

//Runtime:10 ms
#include 
   
     #include "inttypes.h" using namespace std; class Solution { public: int hammingWeight(uint32_t n) { int i = 0; while (n) { i += n & 0x1; n >>= 1; } return i; } }; int main() { Solution s; cout<
    
   

//Runtime:11 ms
class Solution {
public:
    int hammingWeight(uint32_t n) {
        int i = 0;
        while (n)
        {
            n &= (n-1);
            ++i;
        }

        return i;
    }
};