Leetcode: Number of Bits

Question

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Show Tags
Show Similar Problems

---

Solution1

class Solution(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        res = 0

        while n!=0:
            if n%2==1:
                res += 1
            n = n >> 1

        return res

Solution2

The code below is faster. The number of loop is equal to number of bit 1.
refer tt here

class Solution(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        res = 0

        while n!=0:
            res += 1
            n = n & (n-1)

        return res