题目链接:https://leetcode-cn.com/problems/self-dividing-numbers/
题目如下:
class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> res;
for(int i=left;i<=right;i++){
if(isValid(i)) res.push_back(i);
}
return res;
}
bool isValid(int num){
bool res=true;
int num_n=num;
while(num_n){
int temp=num_n%10;
if((temp==0)||((num%temp)!=0)) return false;
num_n/=10;
}
return res;
}
};