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].
从[0,1,1,2]开始循环+1即可
def countBits(self, num):
"""
:type num: int
:rtype: List[int]
"""
res = [0 for i in range(num+1)]
for i in range(1,num+1):
res[i] = res[i-(1<<int(math.log(i,2)))]+1
return res
LeetCode 338. Counting Bits Description Given a non negat...
338. Counting Bits Given a non negative integer number nu...
题目描述 338. Counting Bits Given a non negative integer numb...
338. 比特位计数[https://leetcode-cn.com/problems/counting-bits...
338. 比特位计数[https://leetcode-cn.com/problems/counting-bits...
0X00 leetcode 做了 4 道 leetcode 338. Counting Bits leetcode...
问题描述 Given a non negative integer number num. For every n...
Given a non negative integer numbernum. For every numbers...
Given a non negative integer number num. For every number...
本文标题：338. Counting Bits
本文链接：https://www.haomeiwen.com/subject/pstkdxtx.html
网友评论