Number of 1 BitsWrite a function that takes an unsigned integer and returns the number of ’1' bits i

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 i,res=0;
for(i=0;i<32;i++)
{
if(n%2==1)
{res++;}
//return n;
n = n>>1;//这里要进行赋值，不然不会改变n的值
//return n;

}
return res;
}
};

巴特西

Number of 1 BitsWrite a function that takes an unsigned integer and returns the number of ’1' bits i

最新文章

热门文章