filmov
tv
LeetCode | Task '338. Counting Bits' | Python solution

Показать описание
338. Counting Bits
Given an integer n, return an array ans of length n + 1 such that for each i, ans[i] is the number of 1's 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]
Given an integer n, return an array ans of length n + 1 such that for each i, ans[i] is the number of 1's 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]