728. Self Dividing Numbers

最新推荐文章于 2022-03-31 09:56:14 发布

onefanyf

最新推荐文章于 2022-03-31 09:56:14 发布

阅读量55

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_34471804/article/details/101006199

版权

leetcode 专栏收录该内容

77 篇文章 0 订阅

订阅专栏

#728. Self Dividing Numbers

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]

var selfDividingNumbers = function(left, right) {
    var result = [];
    var flag = 1;
    for(var i=left;i<=right;i++) {
        for(var j=0;j<i.toString().length;j++) {
            if(i.toString()[j]===0 || i%parseInt(i.toString()[j])!==0) {
                flag=0;
            }
        }
        if(flag===1) {
            result.push(i);
        }
        flag=1;
    }
    return result;
};

number->string用number.toString()，括号里的数字可以决定字符串是用几进制转换的
string->number用parseInt(string)