leetCode刷题记录之728
原题
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.
题目大意
自整除数是指可以被自己的各位数字整除的数,比如128的各个组成数字为1,2,8,而128可以被1,2,8整除,所以128是自整除数,显然,自整除数中不能包含0
我的代码
/**
* @param {number} left
* @param {number} right
* @return {number[]}
*/
var selfDividingNumbers = function(left, right) {
var isSelfDiv = function(number)
{
if(new Number(number).toString().indexOf('0') != -1)
{
return false;
}
var factors = new Number(number).toString().split('');
for(var index = 0; index < factors.length; index++)
{
if(number % factors[index] != 0)
{
return false;
}
}
return true;
};
var retArray = [];
for(var index = left; index <= right; index++)
{
if(isSelfDiv(index))
{
retArray.push(index);
}
}
return retArray;
};