191. Number of 1 Bits

最新推荐文章于 2022-09-05 21:24:14 发布

石前有座桥

最新推荐文章于 2022-09-05 21:24:14 发布

阅读量80

点赞数

分类专栏： leetcode-easy

本文链接：https://blog.csdn.net/lyw_321/article/details/89811235

版权

leetcode-easy 专栏收录该内容

121 篇文章 0 订阅

订阅专栏

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

Example 1:

Input: 00000000000000000000000000001011
Output: 3
Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.

Example 2:

Input: 00000000000000000000000010000000
Output: 1
Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.

Example 3:

Input: 11111111111111111111111111111101
Output: 31
Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.

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