Algorithm-week9

Week9

Problem--Medium--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:
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.

Credits:
Special thanks to @ syedee for adding this problem and creating all test cases.

题目解析：

这道题目的状态转移可以分为三种情况：

1.xxx01 + 1 = xxx10

2.xxx0 + 1 = xxx1

3.xx0111...1 + 1 = xx1000...0

那么我们就可以建立一个状态数组，state[i]表示数为i时的二进制表示有多少个1，那么最初始状态就是state[0]即为0时的1的个数，很明显是设为0。然后，子问题不断对原问题进行趋近，这时候我们就需要找出下个状态与先前状态的关系，即状态转移函数。根据上面我的观察可以发现，一个二进制数加1后的二进制数的变化情况就只有3种。并且，根据前后变化我们可以发现前后的数都为1的部分只存在xxx的部分，那么，我们只需算出xxx中1的个数，在这基础上加1即为新的二进制数的1的个数，即新的状态。所以，问题就可以转化为求公共部分xxx00的1的个数，那么我们只需对前后两个状态数按位与，就可以轻易求出xxx000对应的状态，这个状态里存储的就是xxx000部分1的个数，写出状态转移方程为：

state[i] = state[i & (i - 1)] + 1(i != 0)

state[0] = 0

代码：

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> state(num+1, 0);
        for (int i = 1; i <= num; i++) {
            int unchanged_one = state[i&(i-1)];
            state[i] = unchanged_one + 1;
        }
        return state;
    }
};