Leetcode之路 338. Counting Bits

1、题目描述

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.

Hint:

1. You should make use of what you have produced already.
2. Divide the numbers in ranges like [2-3], [4-7], [8-15] and so on. And try to generate new range from previous.
3. Or does the odd/even status of the number help you in calculating the number of 1s?

Tags:
tags: Bit_Manipulation Dynamic_Programming

2、Java实现

• 方法一：

public class Solution {
    public int[] countBits(int num) {
        int[] f=new int[num+1];
        //f[0]=0; //①
        for(int i=1;i<=num;++i){
            f[i]=f[i/2]+i%2;
        }
        return f;
    }
}

• 方法二：

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

3、经验教训

有时候不需要很高明的算法，只需要找到规律，然后巧妙运用就OK了。
①int型数组内的元素会被自动初始化为0，所以这一步可以注释掉。
②” i&1 “相当于” i%2 ” ，” f[i >> 1] “相当于” f[i/2] “。