Leetcode Number of 1 Bits Python 操作32位的数字要小心

Leetcode 191题 Number of 1 Bits
Write a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as the Hamming weight).

Example 1:

Input: 00000000000000000000000000001011
Output: 3
Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.

Example 2:

Input: 00000000000000000000000010000000
Output: 1
Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.

Example 3:

Input: 11111111111111111111111111111101
Output: 31
Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.

---

给你一个32进制的数字，数里面有多少个1.

注意这里不能直接遍历，因为是32位的数字。
要先把32进制的数字转换为2进制。看懂了32位就没什么难的。 直接上代码把。
这里体现了python的脚本优势。

class Solution:
    def hammingWeight(self, n: int) -> int:
        return bin(n).count('1')

疫情中的英国，加油！
12/05/2020