-
Notifications
You must be signed in to change notification settings - Fork 0
/
SelfDividingNumbers.py
28 lines (19 loc) · 1.05 KB
/
SelfDividingNumbers.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
# 728. 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 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:
# My solution
def selfDividingNumbers(self, left, right):
return [x for x in range(left, right + 1) if len(str(x)) == len([y for y in str(x) if int(y) > 0 and x % int(y) == 0])]
## Better solution?
# def selfDividingNumbers(self, left, right):
# return [number for number in range(left, right+1) if '0' not in str(number) and all((number % int(char) == 0 for char in str(number)))]
print(Solution().selfDividingNumbers(1, 22))