题目
难度：easy
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.
第一次解法
/**
* @param {number} left
* @param {number} right
* @return {number[]}
*/
var selfDividingNumbers = function(left, right) {
let res = []
for(let i = left;i <=right;i++){
if(checkNum(i)){
res.push(i)
}
}
return res
};
var checkNum = function(num){
let newNum = num
let dight = 0
while(newNum!=0){
dight = newNum % 10
if(dight === 0 || num % dight !== 0){
return false
}
newNum = Math.floor(newNum/10)
}
return true
}
# runtime : 85ms
