191. Number of 1 Bits

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 m(int n)
    {
        int c=1;
        for(int i=0;i<n;i++)
            c*=2;
        return c;
    }
    int hammingWeight(uint32_t n) 
    {
        int count=0;
        if (n==0)
            return 0;
        int i=31;
        while(n!=0)
        {
            if(m(i)>n)
              --i;
            else
            {
                n=n-m(i);
                ++count;
                --i;
            }
        }
        return count;
    }
};