338. Counting Bits

[TommyCpp]

https://leetcode.com/problems/counting-bits/description/

[TommyCpp]

超过最大递归深度

class Solution:
    def countBits(self, num):
        """
        :type num: int
        :rtype: List[int]
        """
        if num == 0:
            return [0]
        else:
            lst = self.countBits(num - 1)
            log = math.log2(num)
            if log.is_integer():
                lst.append(1)
            else:
                lst.append(lst[num - 2**int(log)] + 1)
            return lst

[TommyCpp]

实际上针对数字的乘除2可以使用位操作来替代