动态规划之计算二进制数中1的个数

LeetCode 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.

分析

这道题比较特别的地方是它要你计算从0到n的所有数的二进制形式的1的个数。这个时候很容易想到可以用动态规划来做，即某个数可以用前面的数得到的结果根据某种特点得到它。这道题要我们计算二进制的1的个数，我们可以通过i/2的数的1的个数再加上它的最后一位得到。
这种做法的时间复杂度是O(n)，空间复杂度是O(1)

代码

class Solution {