191. Number of 1 Bits *

来源:互联网 发布:龙王传说实体书淘宝 编辑:程序博客网 时间:2024/04/29 23:40

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.

class Solution(object):    def hammingWeight(self, n):        """        :type n: int        :rtype: int        """        result = 0        while n>0:            result +=n%2            n/=2        return result

Modified:

Reference

class Solution(object):    def hammingWeight(self, n):        """        :type n: int        :rtype: int        """        result = 0        while n>0:            result +=n &1            n = n>>1        return result


0 0
原创粉丝点击