moonlightshadow123
5/30/2017 - 2:48 PM

191. Number of 1 Bits

  1. Number of 1 Bits
solution.py
content_copyfile_download
class Solution(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        weight = 0
        while n != 0:
            weight += n & 1
            n = n >> 1
        return weight
191-Number-of-1-Bits.md
content_copyfile_download
  • Rendered
  • Source

https://leetcode.com/problems/number-of-1-bits/

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.