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?

关键是要做到O(n)，用dp做，先上自己想的

把数字叠成金字塔型，之后一层层找规律的结果

public class Solution {
    public int[] countBits(int num) {
        if(num==0){
            return new int[]{0};
        }
        if(num==1){
            return new int[]{0,1};
        }
        int[] ans = new int[num+1];
        ans[0] = 0;
        ans[1] = 1;
        int i=2;
        int base=1;
        while(i<=num){
            int s = (int)Math.pow(2,base);
            int e = (int)Math.pow(2,base+1)-1;
            for(;i<=s+s/2-1 && i<=num;++i){
                System.out.println(i-s/2);
                ans[i]=ans[i-s/2];
            }
            for(;i<=e && i<=num;++i){
                ans[i]=ans[i-s/2]+1;
            }
            base++;
        }
        return ans;
    }
}

由更好的办法，规律很简单，以cb()作为二进制中1的个数的函数

cb(7) = cb(7-4)+1，而且用位操作，更简单

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

这题就是结合了位操作和dp，再次显示与二进制相关的题目位操作都是优先的

转载于:https://my.oschina.net/u/2486965/blog/756039