Counting Bits
EasyBit Manipulation
Given an integer n, return an array ans of length n + 1 where ans[i] is the number of 1's in the binary representation of i.
Example:
Input: n = 5
Output: [0,1,1,2,1,2]
Explanation: 0=0, 1=1, 2=10, 3=11, 4=100, 5=101
Constraints:
- •
0 <= n <= 10^5
Counting Bits
EasyBit Manipulation
Given an integer n, return an array ans of length n + 1 where ans[i] is the number of 1's in the binary representation of i.
Example:
Input: n = 5
Output: [0,1,1,2,1,2]
Explanation: 0=0, 1=1, 2=10, 3=11, 4=100, 5=101
Constraints:
- •
0 <= n <= 10^5
Press Run or Ctrl+Enter to execute