Leetcode 191 Number of 1 bits (1-bit digits)

translation

写一个函数获取一个无符号整型数，并且返回它的“1”比特的数目（也被叫做Hamming weight）。例如，一个32位整型数“11”，转换成二进制是00000000000000000000000000001011，所以这个函数应该返回3。

Original

thatintegerandthenumberof ’1itasthethe32integer ’1100000000000000000000000000001011thereturn3.

Analysis

This problem I met before, here directly affixed to the results, wait a moment I tidy up a blog about the bit operations out. You are welcome to come again ...

Code

class Solution {public:    int hammingWeight(uint32_t n) {        intcount0;        while (n) {            ++count;            1) &  n;        }        returncount;    }};

Leetcode 191 Number of 1 bits (1-bit digits)