Leetcode - Counting Bits

Question

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.

This is abit_manip question.

Idea

• Use Leetcode - Number of 1 Bits to get the hamming weight of each value
• Append the output of the hamming weight function to an array lol

Solution