191. 位1的个数

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int ret = 0;
        while (n != 0)
        {
            ret += n & 1;
            n = n >> 1;
        }
        return ret;
    }
};