https://leetcode.com/problems/self-dividing-numbers/description/
Self Dividing Numbers - LeetCode
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. A self-dividing number is not allowed to contain the
leetcode.com
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
class Solution:
def selfDividingNumbers(self, left: int, right: int) -> List[int]:
answer = []
for origin_num in range(left, right + 1):
str_integer = str(origin_num)
if '0' in str_integer:
continue
chk = True
for num in str_integer:
if origin_num % (int(num)) != 0:
chk= False
if chk :
answer.append(origin_num)
return answer
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| leetcode2351. First Letter to Appear Twice (0) | 2023.01.11 |
|---|---|
| leetcode 1768. Merge Strings Alternately (0) | 2023.01.11 |
| leetcode 2427. Number of Common Factors (0) | 2023.01.10 |
| leetcode 2529. Maximum Count of Positive Integer and Negative Integer (0) | 2023.01.10 |
| leetcode 2485. Find the Pivot Integer (0) | 2023.01.10 |
댓글