LeetCode Counting Bits

题目

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 1:

Input: 2
Output: [0,1,1]

Example 2:

Input: 5
Output: [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.

思路：

1.  循环一次，每次计算每个值的二进制表达算法，再count('1')，缺点，如果数字越来越大，计算每个二进制都需要程序调用bin函数

2. 直接使用辗转相除，利用动态规划思路，

 

 

代码1：

class Solution:
    def countBits(self, num: int) -> List[int]:
        res = []
        for i in range(0, num+1):
            res.append(bin(i).count('1'))
        return res

代码2：

The number of 1's in the binary representation of 0 is clearly 0 (base case). For a number n, the number of 1's in its binary representation will be determined as follows:

• If n is odd, the last digit is a '1', so a right shift (which is the same as n//2) will eliminate one 1.
• If n is even, the last digit is a '0', so a right shift (i.e. n//2) will have the same number of 1's

class Solution:

    def countBits(self, num: int) -> List[int]:
        output = [0]
        for i in range(1,num+1):
            a = output[i//2] + (i % 2)
            output.append(a)
                
        return output