easyBit ManipulationDynamic Programming 0 views
Counting Bits
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.
Follow up:
Example 1
Input: n = 2
Output: [0,1,1]
Explanation: 0 --> 0 1 --> 1 2 --> 10
Example 2
Input: n = 5
Output: [0,1,1,2,1,2]
Explanation: 0 --> 0 1 --> 1 2 --> 10 3 --> 11 4 --> 100 5 --> 10^1
Constraints
- 0 <= n <= 10^5
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.