LeetCode-Self Dividing Numbers

Description:
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]

Note:

• The boundaries of each input argument are 1 <= left <= right <= 10000.

题意：给定一个区间范围，要求找出在这个范围内所有满足可以指定要求（这个数可以被自身每一位上的数整除，且每一位上的数都不为0）的整数；

解法：很明显，我们需要遍历这个区间，判断这个数是否满足指定的条件即可；

Java

class Solution {
    public List<Integer> selfDividingNumbers(int left, int right) {
        List<Integer> result = new ArrayList<>();
        for (int i = left; i <= right; i++) {
            int digit = i;
            boolean valid = true;
            while(valid && digit > 0) {
                if (digit % 10 == 0 || i % (digit % 10) != 0) {
                    valid = false;
                }
                digit /= 10;
            }
            if (valid) {
                result.add(i);
            }
        }
        return result;
    }
}