728. Self Dividing Numbers

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.

毕竟基本的题，主要想的是从个位开始往前一个个看能否满足要求，另外注意0的处理。

    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        res = []
        for i in range(left,right+1):
            num = i
            flag = 1
            while i:
                remain = i % 10
                if not remain or num % remain != 0:
                    flag = 0
                    break
                i /=10
            if flag:
                res.append(num)
        return res```