countingBits

countingBits

1. 问题描述

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.
Hint:

You should make use of what you have produced already.
Divide the numbers in ranges like [2-3], [4-7], [8-15] and so on. And try to generate new range from previous.
Or does the odd/even status of the number help you in calculating the number of 1s?

大意是输入一个无符号整数n，返回一个列表，保存0到n的每个整数的二进制表示中1的个数，时间复杂度是线性。

2. 解题思路

原题给了提示，如图所示。将数组按2的幂次展开，后面的结果可以通过前面的结果复制或者加1得到，依次计算所有数组结果。基于观察得到的计算方法，没有经过严格证明。

3. c代码实现

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* countBits(int num, int* returnSize) {

    *returnSize = num+1;
    int* bits=NULL;

    bits=(int*)malloc((num+1)*sizeof(*bits));

    if (num==0) {
        bits[0]=0;
    }
    else if (num==1)
    {
        bits[0]=0;
        bits[1]=1;

    }
    else
    {

        bits[0]=0;
        bits[1]=1;

        for (int i=2; i<=num; i*=2) {
            //1. copy the first half from previous array
            for (int j=i; (j<i+i/2)&&(j<=num); j++) {
                bits[j]=bits[j-i/2];

            }

            //2. plus 1 from the previous array
            for (int j=i+i/2; (j<2*i)&&(j<=num); j++) {
                bits[j]=bits[j-i/2]+1;

            }
        }
    }




    return bits;
}

c源码链接：https://github.com/lilingyu/countingBits

4. 其他

有三种其他算法。
一是通过右移计算，最低位bit递归：ans[n] = ans[n >> 1] + (n & 1)
二是最高位bit递归：ans[n] = ans[n - highbits(n)] + 1
三是按位与：ans[n] = ans[n & (n - 1)] + 1

参考链接：http://bookshadow.com/weblog/2016/03/18/leetcode-counting-bits/