Problem Link
LeetCode Version
Problem Statement
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.
Example:
//Example 1:
Input: n = 2
Output: [...
