Number of 1 Bits
阿新 • • 發佈:2018-12-14
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