LeetCode-Number of 1 Bits-解题报告

原题链接 https://leetcode.com/problems/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.

饭后一个数中位1的个数。

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