LeetCode之Counting Bits

最近在做leetcode上面的题目（官网网址：https://leetcode.com/），记录下自己的思路。

本题网址：https://leetcode.com/problems/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 a rray.
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.

思路：

由题目要求知，现在时间复杂度必须为O(n)，因此我们不能用双重循环的方式。当num等于0或者1,2时，很容易得出；当num>=3时，我们知道当num每大两倍时，其二进制字符串就会多一个1，因此解法如下：

本题答案：

public class Solution {
    public int[] countBits(int num) {
         int[] result = new int[num + 1];
        result[0] = 0;
        if (num == 0)
            return result;
        else if (num == 1) {
            result[1] = 1;
            return result;
        }
        for (int i = 1; i <= 2; i++) {
            result[i] = 1;
            System.out.println(result[i]);
        }
        for (int i = 3; i <= num; i++) {
            result[i] = result[i / 2] + result[i % 2];
            System.out.println(result[i]);
        }
        return result;
    }
}

思路：

由题目要求知，现在时间复杂度必须为O(n)，因此我们不能用双重循环的方式，本题我