python leetcode 728. Self Dividing Numbers

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]
        """
        ans = []
        flag = 1
        for num in range(left, right+1):
            number = list(map(int, str(num)))
            for i in range(len(number)):
                if number[i] != 0 and num % number[i] == 0 :
                    flag = 1
                else:
                    flag = 0
                    break
            if int(flag) == 1:
                ans.append(num)
        return ans