[LeetCode] Challenge log 728

Posted on |
728. Self Dividing Numbers

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

Nothing worth mentioned.

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:

1
2
3
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.

Soulution:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution:
    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        if left > right: return None
        res = []
        
        for num in range(left, right + 1):
            flag = False
            can = num
            while num > 0:
                r = num % 10
                if r == 0 or can % r != 0:
                    flag = True
                    break
                num = num // 10
            if not flag: res.append(can)
        return res
0%