[Leetcode] 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 hammingWeight(uint32_t n) {        int hamming_weight = 0;    while (n > 0) {        hamming_weight += (n % 2);        n /= 2;    }    return hamming_weight;    }};