1、题目
https://leetcode-cn.com/problems/self-dividing-numbers/
2、题意
题解1:
class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> res;
for(int i=left;i<=right;i++)
{
bool flag = true;
string s=to_string(i);
for(int j=0;j<s.size();j++)
{
if(s[j]=='0'||i%(s[j] - '0') != 0)
{
flag = false;
break;
}
}
if(flag)
res.push_back(i);
}
return res;
}
};