题目链接:
https://leetcode.com/problems/self-dividing-numbers/description/
题目描述:
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.
给定一个范围的整数,找出该范围内满足可以被自身每一位整除的整数:
题解:判断一个数能否被自身每一位整除可以用%10的方法提取出最后一位再把原数/10,知道每一位都被提取。
class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> result;
for (int i = left; i <= right; i++) {
if (divide(i)) result.push_back(i);
}
return result;
}
bool divide(int x) {
int t = x;
while (t > 0) {
int mod = t % 10;
t /= 10;
if (mod == 0 || (x % mod != 0)) return false;
}
return true;
}
};
提交结果: