[C]LeetCode: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.

题意为给一个非负数n，计算二进制情况下0到n的数的1的个数，返回一个计数的数组。
题目要求尽量用时间复杂度为O（n），且不使用调用函数。
解法1：
先实现这个函数，不管要求：

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* countBits(int num, int* returnSize) {
    int* p;
    int count=0;
   p=(int*)malloc(sizeof(int)*(num+1));
    for(int i=0;i<num+1;i++)
        {
            count=bit_count(i);
            p[i]=count;
        }
    *returnSize=num+1;
    return p;
}
int bit_count(int i){
    int count=0;
    while(i>0)
    {
        if(i&1==1)
        {
            count++;
        }
        i=i>>1;
    }
        return count;
}

代码对每一个数调用一次bit_count函数，且此调用函数使用位与运算来进行二进制情况下1的计数

解法二：取n为11，则有

可以看出3和7以及5和11,1的数目前者比后者少1，则有count[7]=count[3]+1=count[7/2]+1;且count[6]=count[6/2];
则归纳为count[i]=count[i/2]+(count/2>0?1:0);
则代码为：