Given a non negative integer number **num**. For every numbers **i** in the range **0 â‰¤ i â‰¤ num** calculate the number of 1’s in their binary representation and return them as an array.

**Example:**

For `num = 5`

you should return `[0,1,1,2,1,2]`

.

public class Solution {
public int[] countBits(int num) {
int[] f = new int[num + 1];
for (int i = 1; i <= num; i++)
f[i] = f[i >> 1] + (i&1);
return f;
}
}

### Like this:

Like Loading...

*Related*