Leetcode Algorithms - Dynamic Programming：338. Counting Bits

Description

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:

1. 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?
2. Space complexity should be O(n).
3. Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.

分析

可以发现除了0之外，所有能被2整除的整数的二进制形式都只有一位1。
假定两个能被2整除的数n和2n，对于任意一个数m，n<=m<2n，都存在下面的状态转移方程：
bits(m)=bits(n)+bits(m-n)=1+bits(m-n)
bits(x)表示x的二进制形式中1的个数。
上述状态转移方程成立的原因是m并不会在n的基础上造成进位，所以可以简单地进行相加操作从而求出bits(m)；同时bits(m-n)一定在之前就已经求出来了。
代码实现中使用变量next储存2n的值，变量pre储存n的值。

代码

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> bits;
        bits.push_back(0);
        if (num == 0)
            return bits;
        bits.push_back(1);
        if (num == 1)
            return bits;
        int next = 2, pre = 1;
        for (int i = 2; i <= num; i++) {
            if (i == next) {
                bits.push_back(1);
                pre = next;
                next *= 2;
            } else {
                int count = 1 + bits[i - pre];
                bits.push_back(count);
            }
        }
        return bits;
    }
};