LeetCode：Number of 1 Bits（位1的个数）

题目

Write a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight).

Example 1:

Input: 11
Output: 3
Explanation: Integer 11 has binary representation 00000000000000000000000000001011 

Example 2:

Input: 128
Output: 1
Explanation: Integer 128 has binary representation 00000000000000000000000010000000

思路

看该数的奇偶性可以判断最后一个位是0还是1，判断为1，count+1，将数字右移1位，在判断。

代码

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int count=0;
        while(n)
        {
            if(n%2==1)
                count++;
            n=n>>1;
        }
        return count;
    }
};