Python实现"位1的个数"的四种方法

最新推荐文章于 2024-07-13 08:41:21 发布

求兵

最新推荐文章于 2024-07-13 08:41:21 发布

阅读量3.6k

点赞数 1

分类专栏： Algorithms

本文链接：https://blog.csdn.net/qiubingcsdn/article/details/82669069

版权

Algorithms 专栏收录该内容

106 篇文章 5 订阅

订阅专栏

给定一个无符号整数，返回该整数二进制表示中"1"的个数

Example 1:

Input: 11
Output: 3
Explanation: Integer 11 has binary representation 00000000000000000000000000001011

Example 2:

Input: 128
Output: 1
Explanation: Integer 128 has binary representation 00000000000000000000000010000000

1：整数转二进制的基本方法，判断每一次求余数时余数是否为"1"，是的话就累加

def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        sum = 0
        while n>0:
            res = n%2
            if res==1:
                sum += 1
            n = n//2
        return sum

2：bin()+count()方法（参考他人代码）

def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        return bin(n).count('1')

3：位运算（参考他人代码）

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

4：模拟位运算（参考他人代码）

def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        sum = 0
        bit = 1
        while bit<=n:
            if bit&n>0:
                sum += 1
            bit *= 2
        return sum

算法题来自：https://leetcode-cn.com/problems/number-of-1-bits/description/