# Leetcode 338 - Counting bits

`Note:`

- Let’s just stick to the most naive soltution.
- Use
`&`

to get the the digit. - Use
`>> 1`

to left shift.

`Question:`

Given an integer `n`

, return an array `ans`

of length `n + 1`

such that for each i (0 <= i <= n), ans[i] is the `number`

of `1's`

in the binary representation of i.

`Example:`

1 | Input: n = 5 |

`Code:`

1 | /** |