【LeetCode】728. Self Dividing Numbers

728. Self Dividing Numbers

https://leetcode.com/problems/self-dividing-numbers/description/

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.

分析：

就是判断一个数字是否是自除数，如果这个数字能整除它每一位数上的数字那么就是自除数

sol1: 

将这个数字转换成str形式

class Solution:
    def selfDividingNumbers(self, left, right):
        return [i for i in range(left,right+1) if not any([m == '0' or i % int(m) != 0 for m in str(i)])]