【python3】leetcode 728. Self Dividing Numbers （easy）

728. Self Dividing Numbers （easy）

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]

1 暴力破解

class Solution:
    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        selfD = []
        for i in range(left,right+1):
            strnum = str(i)
            tag = 0
            for x in strnum:
                if int(x) == 0 or i % int(x) !=0:
                    tag = 1
                    continue
            if tag == 0:selfD.append(i)
        return selfD