leetcode - 728 - 自除數
阿新 • • 發佈:2018-11-06
leetcode 演算法題 (python),從易到難,分享到部落格,促進自己堅持刷題。
class Solution:
def selfDividingNumbers(self, left, right):
"""
:type left: int
:type right: int
:rtype: List[int]
"""
nums = []
a = 0
for num in range(left, right + 1):
if "0" not in str(num): #去除有0的數
for i in str(num):
if num % int(i)==0:
a = num
continue
else:
a = 0
break
nums.append(a)
while 0 in nums:
nums.remove(0)
return nums