分析
写个check函数然后逐一判断放入ans即可
ac code
class Solution:
def selfDividingNumbers(self, left: int, right: int) -> List[int]:
def check(x):
x_to_str = str(x)
for c in x_to_str:
if c == '0':
return False
if x % int(c) != 0:
return False
return True
ans = []
for i in range(left, right + 1):
if check(i):
ans.append(i)
return ans
总结
对于简单题 我们重拳出击