728. Self Dividing Numbers [for ...else]

最新推荐文章于 2022-03-31 09:56:14 发布

mygodhome

最新推荐文章于 2022-03-31 09:56:14 发布

阅读量140

点赞数

分类专栏： Python Leetcode

本文链接：https://blog.csdn.net/mygodhome/article/details/85018452

版权

Python 同时被 2 个专栏收录

78 篇文章 0 订阅

订阅专栏

Leetcode

43 篇文章 0 订阅

订阅专栏

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]
        """
        List = []
        if right < 10:
             return [num for num in range(left, right+1)]
        else:
             for i in range(left, right+1):
                for d in str(i):
                    if int(d) == 0 or i % int(d) != 0:
                          break
                else:
                        List.append(i)

        return List

注意line16，for ... else；

https://www.cnblogs.com/dspace/p/6622799.html