# 728. Self Dividing Numbers

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`.

``````class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> res;
for (int i = left; i <= right; ++i) {
if (check(i)) res.push_back(i);
}
return res;
}
bool check(int num) {
string str = to_string(num);
for (char c : str) {
if (c == '0' || num % (c - '0')) return false;
}
return true;
}
};
``````

``````class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> res;
for (int i = left, n = 0; i <= right; ++i) {
for (n = i; n > 0; n /= 10) {
if (n % 10 == 0 || i % (n % 10) != 0) break;
}
if (n == 0) res.push_back(i);
}
return res;
}
};
``````

Perfect Number

https://discuss.leetcode.com/topic/111201/java-c-clean-code

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation