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.
Subscribe to see which companies asked this question
关键是熟练掌握位移运算
class Solution(object):
def hammingWeight(self, n):
"""
:type n: int
:rtype: int
"""
sum =0
while n:
sum+= n&1
n >>=1
return sum