地址:https://leetcode.com/problems/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]
Note:
- The boundaries of each input argument are
1 <= left <= right <= 10000
.
理解:
想到的方式就是暴力算,每个数字去判断是不是self dividing。
实现:
没有什么技巧,挨个算一遍。
class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> res;
for (int i = left; i <= right; ++i) {
if (isSelfDividing(i))
res.push_back(i);
}
return res;
}
bool isSelfDividing(int num) {
int n = num;
while (n) {
if (n % 10 == 0 || num % (n % 10) != 0)
return false;
n /= 10;
}
return true;
}
};
无聊。。