Leetcode338. Counting Bits

原题

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].

Follow up:

It is very easy to come up with a solution with run time O(n*sizeof(integer)). But can you do it in linear time O(n) /possibly in a single pass?
Space complexity should be O(n).
Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.

大意
给出一个整数nums，算出从0到nums中所有数的二进制中1的个数，并且以数组的形式返回。
思路
本来这道题没有思路，看了其他人的解法，才知道有一个数学公式，自己却没有想到，验证了一下，思路确实是正确的。第i位1的个数就是第i/2位+（i%2）的数值。
代码

public class Solution {
    public int[] countBits(int num) {
        int[]f=new int [num+1];
        for(int i=0;i<=num;i++){
            f[i]=f[i/2]+i%2;
        }
       return f; 
    }
}

原题链接