/**
* @param {number} left
* @param {number} right
* @return {number[]}
*/
var selfDividingNumbers = function(left, right) {
let ret = [];
for(let i = left; i<= right; i++){
if(i <= 9) {
ret.push(i)
}
else{
let isSelfDividingNumber = true;
i.toString().split('').forEach(n => {
if(i % n !== 0){
isSelfDividingNumber = false
}
})
isSelfDividingNumber && ret.push(i)
}
}
return ret
};
LeetCode - 728. 自除数
最新推荐文章于 2024-07-21 12:49:49 发布