Number of 1 Bits

最新推荐文章于 2024-03-21 15:46:19 发布

Goofiness

最新推荐文章于 2024-03-21 15:46:19 发布

阅读量108

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/byr_wy/article/details/83017722

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

Number of i Bits

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

Example

Input: 11
Output: 3
Explanation: Integer 11 has binary representation 00000000000000000000000000001011
Input: 128
Output: 1
Explanation: Integer 128 has binary representation 00000000000000000000000010000000

Solution

class Solution(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        count = 0
        while n:
            count += 1
            n &= n-1
        return count

Result
Result