Skip to content
CodeShare
All problems

Counting Bits

Count the 1s in the binary form of every number up to n.

EasyBit manipulationDynamic programming

Given an integer n, return an array ans of length n + 1 where ans[i] is the number of 1 bits in the binary representation of i.

Examples

Example 1
Input
n = 2
Output
[0, 1, 1]
Why
0 is 0, 1 is 1 and 2 is 10 in binary.
Example 2
Input
n = 5
Output
[0, 1, 1, 2, 1, 2]

Constraints

  • 0 <= n <= 10^5