【leetcode刷题】T211-自除数

示例 1：
输入： 
上边界left = 1, 下边界right = 22
输出： [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

class Solution(object):
    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        # 特殊情况
        ls = list(range(0, 10))
        if 0 < left <= right < 10:
            return ls[left: right+1]

        if left >= 10:
            ls = []
        else:
            ls = ls[left:]

        for i in range(max(11, left), right+1):
            tmp = i
            while tmp > 0:
                tmp2 = tmp % 10
                if tmp2 == 0 or i % tmp2 != 0:
                    break
                tmp /= 10
            if tmp == 0:
                ls.append(i)
        return ls