[LeetCode][Python3] 338. Counting Bits
2019. 9. 24. 01:03 |
프로그래밍/LeetCode
Problem :
https://leetcode.com/problems/counting-bits/
My Solution :
class Solution:
def countBits(self, num):
ans = [0]*(num+1)
size = 1
while True:
for i in range(size):
try:
ans[i+size] = ans[i]+1
except:
return ans
size *= 2
'프로그래밍 > LeetCode' 카테고리의 다른 글
[LeetCode][Python3] 337. House Robber III (0) | 2019.10.02 |
---|---|
[LeetCode][Python3] 142. Linked List Cycle II (0) | 2019.10.01 |
[LeetCode][Python3] 647. Palindromic Substrings (1) | 2019.09.25 |
[LeetCode][Python3] 406. Queue Reconstruction by Height (0) | 2019.09.23 |
[LeetCode][Python3] 90. Subsets II (0) | 2019.09.17 |
[LeetCode][Python3] 739. Daily Temperatures (0) | 2019.09.12 |
[LeetCode][Python3] 401. Binary Watch (0) | 2019.09.05 |
[LeetCode][Python3] 692. Top K Frequent Words (0) | 2019.09.03 |
최근에 달린 댓글 최근에 달린 댓글