题目连接

https://leetcode.com/problems/number-of-1-bits/  

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.

class Solution {
public:
	int hammingWeight(uint32_t n) {
		int ans = 0;
		while (n) {
			ans += n & 1;
			n >>= 1;
		}
		return ans;
	}
};

leetcode Number of 1 Bits

原文：http://www.cnblogs.com/GadyPu/p/5028203.html