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
.
题目的意思就是给你一个范围,让你判断出这个范围内的数字能否被它组成自己的数整除。
比如128,能被1、2、8分别整除,题目就是要求找出这样的数字,包括边界。
思路,直接用求余等来做:
或者暴力点,将这个数变成字符串直接用python的库来判断:class Solution(object): def selfDividingNumbers(self, left, right): """ :type left: int :type right: int :rtype: List[int] """ result=[] for i in range(left,right+1): j=i flag=0 while(j>0): if(j%10==0): flag=1 break elif(i%(j%10)!=0): flag=1 break else: j=j//10 if(flag==0):result.append(i) return result s=Solution() print(s.selfDividingNumbers(1,22))
def is_self_dividing(x): s = str(x) for d in s: if d=="0" or x%int(d)!=0: return False return True class Solution(object): def selfDividingNumbers(self, left, right): """ :type left: int :type right: int :rtype: List[int] """ ans = [] for x in xrange(left, right+1): if is_self_dividing(x): ans.append(x) return ans