LeetCode：Number of 1 Bits

Problems:

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.

Solution:

class Solution {
public:
    int hammingWeight(unsigned int  n) {
        
    int i=0;
    while(n>0)
    {
       int temp = n&0x1;
       if(temp==1)
       {
        i++;
       }
       n=n>>1;
    }
    return i;
        
    }
};