leetcode 728. Self Dividing Numbers

最新推荐文章于 2023-02-25 23:03:36 发布

cainiaohudi

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量203

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/cainiaohudi/article/details/83615581

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

class Solution(object):
    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        output = []
        for i in range(left,right+1):
            if i<10:
                output.append(i)
            elif 10<=i<100:
                ge = i%10
                shi = i//10
                sign = (ge != 0)
                if sign and i%ge==0 and i%shi==0:
                    output.append(i)
            elif 100<=i<1000:
                ge = i % 10
                shi = (i // 10)%10
                bai = i // 100
                sign = (ge!=0)and(shi!=0)
                if sign and i % ge == 0 and i % shi == 0 and i % bai == 0:
                    output.append(i)
            elif 1000<=i<10000:
                ge = i % 10
                shi = (i // 10) % 10
                bai = (i // 100) % 10
                qian = i//1000
                sign = (ge != 0) and (shi != 0) and (bai != 0)
                if sign and i % ge == 0 and i % shi == 0 and i % bai == 0 and i % qian == 0:
                    output.append(i)
        return output