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.
Example 1:
Input:
left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
代码如下:
public static List<Integer> selfDividingNumbers(int left, int right) {
List<Integer> list = new ArrayList<Integer>();
for (int i = left; i <= right; i++) {
if(isDividNumber(i)==true)
list.add(i);
}
return list;
}
public static Boolean isDividNumber(int num){
int temp = num;//temp来计算末尾的数
while(temp>0){
int rail_num = temp%10;
if (rail_num==0) {
return false;
}
if(num % rail_num==0) {
temp/=10;//如果%==0那么就temp/10
}
else return false;
}
return true;
}