Counting bits
Easybit manipulationdynamic programming
Return an array of length n + 1 where element i is the number of 1 bits in i's binary form. Aim for O(n).
Example 1
Input: n = 2 Output: [0,1,1]
Example 2
Input: n = 5 Output: [0,1,1,2,1,2]
Constraints
- 0 ≤ n ≤ 10⁵
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int} n
* @return {int[]}
*/
function countBits(n) {
}