# Leetcode 191 - Number of 1 bits

Write a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight).

**Note:** Another Hole-in-One! The pro way is to use bit manipulation - use `>>`

to adjust the last digit of n and use `&`

to get the last digit. This question is really similar to `Reverse Bits`

.

**Example 1:**

1 | Input: n = 00000000000000000000000000001011 |

1 | /** |