[LeetCode 338] Counting Bits

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 timeO(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?

题目大意：给定一个非负整数num。对于每一个满足0 ≤ i ≤ num的数字i，计算其数字的二进制表示中1的个数，并以数组形式返回。

class Solution(object):
    def countBits(self, num):
        """
        :type num: int
        :rtype: List[int]
        """
        res=[0]
        for eachNum in range(1,num+1):
            res.append(res[eachNum>>1] + (eachNum&1)) #与1且:由于移位相当于/2，那就必然出现一个res[]要对应2个数字，用 与1且 来判断出现的是前一个（不加1），还是后一个（加1）
        return res
    
        
        

例如要生成14（二进制：1110）和15（1111）中1出现次数，这时候可以用移位的方式调用7（右移一位，二进制表示：111） 然后 根据14和15的最后一位是0还是1 决定是否加一 ，生成对应的1出现次数。