LeetCode--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.

代码：

    int hammingWeight(uint32_t n) {        if(n == 0)        {            return 0;        }        else        {            int s = 0;            int count = 0;            while(n > 0)            {                s = n%2;                n = n/2;                if(s == 1)                {                    ++count;                }            }            return count;        }    }

在将n转成二进制的过程中统计1出现的次数