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.
求0 ≤ i ≤ num中每个数的二进制数中‘1’的个数。
考虑奇偶性,将当前的数右移一位,若当前数是奇数那么1的个数不变;否则1的个数加一。
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.
class Solution:
def countBits(self, num):
"""
:type num: int
:rtype: List[int]
"""
"""
ans = []
for each in range(num+1):
ans.append(bin(each).count('1'))
return ans
"""
ans = [0]
for i in range(1, num + 1):
ans.append(ans[i >> 1] + (i & 1))
return ans