题目: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.
写一个函数,记录二进制无符号整数当中1的个数
解题思路1:使用python函数bin()和count()
bin()方法:bin(x),将整数x转换为二进制字符串
count()方法:str.count(sub, start= 0,end=len(string))。其中:sub–搜索的字符串。
start–符串开始搜索的位置。默认为第一个字符,第一个字符索引值为0。
end – 字符串中结束搜索的位置。字符中第一个字符的索引为 0。默认为字符串的最后一个位置。
代码1:
class Solution(object):
def hammingWeight(self, n):
"""
:type n: int
:rtype: int
"""
return bin(n).count('1')
解题思路2:将n与1相与,然后1再移位
for i in range(32):
if (1>>i)&n:
count +=1
代码2:
class Solution(object):
def hammingWeight(self, n):
"""
:type n: int
:rtype: int
"""
return len([i for i in range(32) if (1<<i)&n])
解题思路3:利用n%2记录1的个数
代码3:
class Solution(object):
def hammingWeight(self, n):
"""
:type n: int
:rtype: int
"""
count=0
while n>0:
count +=x%2
x=x/2
return count