【LeetCode】728. Self divisor

subject

728. Self divisor

Self divisor It refers to the number that can be divided by every digit it contains .

• for example ,128 It's a Self divisor , because 128 % 1 == 0,128 % 2 == 0,128 % 8 == 0.

Self divisor Inclusion is not allowed 0 .

Given two integers left and right , Return a list , The elements of the list are ranges [left, right] All of the inside Self divisor .

Example 1：

 Input ：left = 1, right = 22
 Output ：[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

Example 2:

 Input ：left = 47, right = 85
 Output ：[48,55,66,77]

Tips ：

• 1 <= left <= right <= 104

Ideas

• Define a function , If a natural number contains zero or is divided by its own number of digits without leaving zero, it is not a self divisor , Otherwise it would be

Code

class Solution:
    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
        res =[]
        def isSelfDevidingNumber(n: int):
            for i in str(n):
                if int(i) ==0 or n % int(i) != 0:
                    return False
            return True
        for i in range(left,right+1):
            if isSelfDevidingNumber(i): res.append(i)
        return res

Complexity

• Time complexity ：$O(n)$
• Spatial complexity ：$O(1)$