Leetcode 728. Self Dividing Numbers

class Solution:
    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
        ans = []
        for i in range(left, right+1):
            if self.decide(i):
                ans.append(i)
        return ans

    def decide(self, number: int) -> bool:
        num = str(number)
        for i in num:
            if i == '0' or (number % int(i)) != 0:
                return False
        return True

 

转载于:https://www.cnblogs.com/zywscq/p/10680979.html