## Description

https://leetcode.com/problems/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:00000000000000000000000000001011Output:3Explanation:The input binary string

00000000000000000000000000001011has a total of three '1' bits.

**Example 2:**

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

**Example 3:**

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

**Note:**

- Note that in some languages such as Java, there is no unsigned integer type. In this case, the input will be given as signed integer type and should not affect your implementation, as the internal binary representation of the integer 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**above the input represents the signed integer`-3`

.

**Follow up**:

If this function is called many times, how would you optimize it?

## Explanation

use a mask to count how many 1’s.

## Python Solution

```
class Solution:
def hammingWeight(self, n: int) -> int:
count = 0
mask = 1
for _ in range(32):
if n & mask != 0:
count += 1
mask = mask << 1
return count
```

- Time complexity: O(1).
- Space complexity: O(1).

## One Thought to “LeetCode 191. Number of 1 Bits”