"""
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.
"""

class Solution:
    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        result = []
        while left <= right:
            flag = True
            l = [int(i) for i in list(str(left))]
            for i in range(len(l)):
                if l[i] == 0:
                    flag = False
                    break
                if left % l[i] == 0:
                    l[i] = 0
            if sum(l) == 0 and flag == True:
                result.append(left)
            left +=1
        return result
8d62be12812a18d5e45a8cc9ae047b53d12dbff3
<mask token>

<mask token>


class Solution:
    <mask token>

<mask token>


class Solution:

    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        result = []
        while left <= right:
            flag = True
            l = [int(i) for i in list(str(left))]
            for i in range(len(l)):
                if l[i] == 0:
                    flag = False
                    break
                if left % l[i] == 0:
                    l[i] = 0
            if sum(l) == 0 and flag == True:
                result.append(left)
            left += 1
        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.
"""

class Solution:
    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        result = []
        while left <= right:
            flag = True
            l = [int(i) for i in list(str(left))]
            for i in range(len(l)):
                if l[i] == 0:
                    flag = False
                    break
                if left % l[i] == 0:
                    l[i] = 0
            if sum(l) == 0 and flag == True:
                result.append(left)
            left +=1
        return result