标签：
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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
#include<iostream>
using namespace std;
#define uint32_t unsigned int
int hammingWeight(uint32_t n) {
int re=0;
while(n)
{
re++;
n=n&(n-1);
}
return re;
}
int main()
{
}
leetcode_171题——Number of 1 Bits（位运算）
标签：
原文地址：http://www.cnblogs.com/yanliang12138/p/4659057.html
