—Easy
https://leetcode.com/problems/self-dividing-numbers/
Code:
class Solution(object): def selfDividingNumbers(self, left: int, right: int) : ans_list = [] for i in range(left,right+1): flag = True i = str(i) for elt in i: if int(elt) == 0: flag = False else: if int(i) % int(elt) != 0: flag = False break if flag == True: ans_list.append(int(i)) return ans_list # s = Solution() # print(s.selfDividingNumbers(1,22))
思路:
1.注意0
2.注意int和str的相互转化