LeetCode 0191 - Number of 1 Bits

Reck Zhang

发布于 2021-08-11 14:54:30

1730

发布于 2021-08-11 14:54:30

Number of 1 Bits

Desicription

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 cnt = 0;
        while(n)
            cnt += n & 1, n >>= 1;
        return cnt;
    }
};

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2018-06-11，如有侵权请联系 cloudcommunity@tencent.com 删除

function

integer

unsigned

本文分享自作者个人站点/博客前往查看

如有侵权，请联系 cloudcommunity@tencent.com 删除。

本文参与腾讯云自媒体分享计划，欢迎热爱写作的你一起参与！

function

integer

unsigned

登录后参与评论

0 条评论

热度

LeetCode 0191 - Number of 1 Bits

LeetCode 0191 - Number of 1 Bits

Number of 1 Bits

Desicription

Solution

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐