【Java】【LeetCode】338. 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 1:

Input: 2
Output: [0,1,1]

Example 2:Input: 5
Output: [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.

题解：

runtime为O(n),通过观察发现每到2^n的时候为1，[2^n ~ 2^(n+1))，其结果为[0 ~ 2^(n-1))的结果加1，因为相比较而言，就是第一个标志位多了一个1（实际就是每个数加了2^n）。

0000    0
-------------
0001    1
-------------
0010    1
0011    2
-------------
0100    1
0101    2
0110    2
0111    3
-------------
1000    1
1001    2
1010    2
1011    3
1100    2
1101    3
1110    3
1111    4

代码：

public class CountingBits {

    public static void main(String[] args) {
        /**
         * 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 1: Input: 2 Output: [0,1,1]
         */
        int[] output1 = countBits(2);
        LeetCodeUtil.printIntArray(output1, output1.length);
        /**
         * Example 2: Input: 5 Output: [0,1,1,2,1,2]
         */
        int[] output2 = countBits(5);
        LeetCodeUtil.printIntArray(output2, output2.length);
    }

    public static int[] countBits(int num) {
        int[] res = new int[num + 1];
        res[0] = 0;
        int pow = 1;
        for (int i = 1, t = 0; i <= num; i++, t++) {
            if (i == pow) {
                pow = pow * 2;
                t = 0;
            }
            res[i] = res[t] + 1;
        }
        return res;
    }

}