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.

Constraints

  • 0 <= n <= 10^5
View editorial solution
Saving… · 2 lines
class Solution:
def countBits(self, n: int) -> List[int]:
Console

Click Run to execute sample tests.