【LeetCode】728. Self Dividing Numbers

最新推荐文章于 2023-02-25 23:03:36 发布

sa酱

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量350

点赞数

分类专栏： leetCode 文章标签： javascript leetcode

本文链接：https://blog.csdn.net/lx583274568/article/details/78611119

版权

leetCode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

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) {
    var ret=[];
    for(var i=left;i<=right;i++){
        if(isDividingNumber(i)){
            ret.push(i);
        }
    }
    return ret;
};
function isDividingNumber(num){
    var digit=num.toString();
    for(var i=0;i<digit.length;i++){
        if(digit[i]==0){
            return false;
        }else if(num%digit[i]!=0){
            return false;
        }
    }
    return true;
}