LeetCode 338. Counting Bits

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:

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

Analysis
这道题的意思是给定一个整数n，求从0到n的每一个整数中的二进制表示中的1的位数。
可以看出从十进制转化为二进制的方法是不断利用这个整数除以2，最后直到商为0之后才停止。每一次除以2所得余数中1的个数即为二进制表示中1的个数。
所以利用动态规划，不难看出当前整数的二进制表示含有1的个数等于n除以2后的商的二进制表示中含有1的个数加上n除以2中的余数。

Code

#include<iostream>
using namespace std;

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> dp;
        for(int i =0;i<=num;++i){
            dp.push_back(0);
        }

        for(int i = 0;i<=num;++i){
            dp[i] = dp[i/2]+i%2;
        }

        return dp;
    }
};