Counting Bits

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

Input:

Output:

0 1 1 2 1 2

Reasoning:

The function generates an array of length $n+1$ , where $n$ is the input integer, so for $n = 5$ , the array will have 6 elements.
It then iterates over each number $i$ from 0 to $n$ (inclusive), converting $i$ to its binary representation and counting the number of 1s.
The binary representations and their corresponding 1s counts are as follows:
- $0_{10} = 0_2$ (0 ones)
- $1_{10} = 1_2$ (1 one)
- $2_{10} = 10_2$ (1 one)
- $3_{10} = 11_2$ (2 ones)
- $4_{10} = 100_2$ (1 one)
- $5_{10} = 101_2$ (2 ones)
The final output is an array containing these counts in order: [0, 1, 1, 2, 1, 2].