191.number-of-1-bits.47113001.ac.cpp

/*
 * [191] Number of 1 Bits
 *
 * https://leetcode.com/problems/number-of-1-bits
 *
 * Easy (39.36%)
 * Total Accepted:    
 * Total Submissions: 
 * Testcase Example:  '           0 (00000000000000000000000000000000)'
 *
 * 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.
 */
class Solution {
	public:
		int hammingWeight(uint32_t n) {
			int count = 0;
			do
			{
				if((n&1))count++;
			}while(n>>=1);
			return count;
		}
};