[LeetCode]Self Dividing Numbers@Python

原创于 2019-04-22 21:43:31 发布 · 134 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python

leetcode 同时被 2 个专栏收录

232 篇文章

订阅专栏

trick

10 篇文章

订阅专栏

本文深入探讨了自除数的概念及其实现算法。自除数是指一个数能被其所有位上的数字整除，且不含0。文章通过具体示例解释了如何筛选出自除数，并提供了一段Python代码实现，该算法遍历指定范围内的数字，检查每个数字是否为自除数。

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

Input:
left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

Solution

class Solution:
    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
        return [x for x in range(left, right+1) if all((i and (x%i==0) for i in map(int,str(x))))]