leetcode/hammingWeight.py at master · Kymoraa/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
"""
Write a function that takes an unsigned integer and returns the number of '1' bits it has
(also known as the Hamming weight).

Note:

Note that in some languages, such as Java, there is no unsigned integer type.
In this case, the input will be given as a signed integer type.
It should not affect your implementation, as the integer's internal binary representation is the same,
whether it is signed or unsigned.
In Java, the compiler represents the signed integers using 2's complement notation.
Therefore, in Example 3, the input represents the signed integer. -3.


Example 1:

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

N.B Consider better solutions using bit manipulation

"""


class Solution:
    def hammingWeight(self, n: int) -> int:
        count = 0
        for i in bin(n):
            if i == '1':
                count += 1  # counting and summing the number of 1's
        return count