`

Number of 1 Bits——Bit Manipulation

 
阅读更多

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(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        re = 0
        while n:
        	n = n & (n-1)
        	re += 1
        return re 

 

分享到:
评论

相关推荐

Global site tag (gtag.js) - Google Analytics