728. Self Dividing Numbers

标签：use   VID   type   app   lse   possible   upper   visible   ber   

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]
        """
        def judge(n):
            s = str(n)
            if ‘0‘ in s:
                return False
            for i in s:
                if n%int(i) != 0:
                    return False
            return True
        num = []
        for i in range(left,right+1):
            if judge(i):
                num.append(i)
        return num

728. Self Dividing Numbers

标签：use   VID   type   app   lse   possible   upper   visible   ber   

原文地址：https://www.cnblogs.com/bernieloveslife/p/9734922.html