338. Counting Bits

338. Counting Bits

• Difficulty: Medium

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?

提示：

1. 在求整数转换成二进制数，有多少个1的题中，我们使用了如下方法：

每次i&(i-1)就可以去除末位的1；

（1）假设n为奇数100111

减去1后得到的数  100110

两数相与 得到       100110

 

（2）假设n为偶数101100

减去1后得到的数  101011

两数相与 得到        101000

由此可以得出，i&(i-1)可以去除末位的一个1，循环这个动作，每循环一次，计数加1，当i==0时，循环结束！

public class Solution {
    public int[] countBits(int num) {
       int[] list=new int[num+1];
       for(int i=0;i<=num;i++){
           int count=0;
           int j=i;
           while(j!=0){
               count++;
               j=j&(j-1);
           }
           list[i]=count;
       }
       return list;
    }
}

 

转载于:https://my.oschina.net/yangdongchun/blog/756329