easyBit Manipulation
Counting Bits
## Problem
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`.
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`.
Examples
Input
n = 2
Output
[0,1,1]
0→0 bits, 1→1 bit, 2→1 bit.
Input
n = 5
Output
[0,1,1,2,1,2]
0-5 in binary: 0,1,10,11,100,101.
Constraints
0 <= n <= 10^5
Python
Loading...