class Solution {
public List<Integer> selfDividingNumbers(int left, int right) {
List<Integer> list = new ArrayList<>();
for(int i = left;i<=right;i++){
if(isDivided(i)){
list.add(i);
}
}
return list;
}
public boolean isDivided(int num){
int a = num;
while(num>0){
int tmp = num%10;
if(tmp==0 || a%tmp!=0) return false;
num /= 10;
}
return true;
}
}
leetcode 728. Self Dividing Numbers
最新推荐文章于 2024-10-07 07:09:00 发布