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
解题思路
这道题考察的就是二进制移位操作
Solution
class Solution {
public:
int hammingWeight(uint32_t n) {
int total = 0;
for(int i = 0; i < 32; ++i) {
total += (n & 1);
n = n >> 1;
}
return total;
}
};