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

思路:后面的结果充分利用前面的结果，i的1的个数可以这样计算，将i右移一位，如果判断i被移掉的那一位是不是1，所以nums[i]=nums[i>>1]+i&1;根据上面这个递推式，就能ac了，时间复杂度是o(n)，空间复杂度是0

代码如下(已通过leetcode)

public class Solution {
   public int[] countBits(int num) {
    int[] res=new int[num+1];
    res[0]=0;
    for(int i=1;i<=num;i++) 
    res[i]=res[i>>1]+(i&1);
    return res;
   }
}