https://leetcode.com/problems/self-dividing-numbers/description/
题解:用变量i遍历left到right的所有数,利用变量t进行除和取余的操作来遍历每个数的每位数,从而进行验证是否为self-dividing number。
class Solution {
public List<Integer> selfDividingNumbers(int left, int right) {
List<Integer> list = new ArrayList<>();
for(int i = left; i <= right; i++) {
int t = i;
while (t%10!=0) {
if(i%(t%10) == 0)
t = t/10;
else
break;
}
if(t==0)
list.add(i);
}
return list;
}
}