Leetcode #191 Number of 1 Bits

Question:

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.

即是求給定數的二進制表示中，1的個數。難度是EASY

Submission:

class Solution {
public:
    int hammingWeight(uint32_t n) { 
    	int tmp = 0x00001;
    	int sum = 0;
    	while(n>0)
    	{
    		sum += n & tmp;
    		n /= 2;
    	}
    	return sum;
    }
};