Counting Bits
Easy
Topics
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.
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^5
Run ⌘' · Submit ⌘⏎