'''
A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Also, a self-dividing number is not allowed to contain the digit zero.

Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

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

The boundaries of each input argument are 1 <= left <= right <= 10000.
'''
#   Accepted Codes:
class Solution:
    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
        result = []
        for i in range(left, right + 1):
            if '0' in str(i):
                continue
            numString = str(i)
            selfDividing = 1
            for string in numString:
                string = int(string)
                if i % string != 0:
                    selfDividing = 0
                    break
            if selfDividing == 1:
                result.append(i)
        return result

#   52 ms, 13.2 MB
bd93d2e5e4dcbe1bbfac2d0219f9e052e467d0d3
<mask token>

<mask token>


class Solution:
    <mask token>

<mask token>


class Solution:

    def selfDividingNumbers(self, left: int, right: int) ->List[int]:
        result = []
        for i in range(left, right + 1):
            if '0' in str(i):
                continue
            numString = str(i)
            selfDividing = 1
            for string in numString:
                string = int(string)
                if i % string != 0:
                    selfDividing = 0
                    break
            if selfDividing == 1:
                result.append(i)
        return result

'''
A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Also, a self-dividing number is not allowed to contain the digit zero.

Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

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

The boundaries of each input argument are 1 <= left <= right <= 10000.
'''
#   Accepted Codes:
class Solution:
    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
        result = []
        for i in range(left, right + 1):
            if '0' in str(i):
                continue
            numString = str(i)
            selfDividing = 1
            for string in numString:
                string = int(string)
                if i % string != 0:
                    selfDividing = 0
                    break
            if selfDividing == 1:
                result.append(i)
        return result

#   52 ms, 13.2 MB