[LeetCode] Problem 728 - Self Dividing Numbers

Posted on | In ,

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

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.

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
public List<Integer> selfDividingNumbers(int left, int right) {
    List<Integer> result = new ArrayList<>();

    for (int ans = left; ans <= right; ans++) {
        int i = ans;

        while (i != 0) {
            int d = i % 10;

            if (d == 0 || ans % d != 0) 
                break;

            i /= 10;
        }

        if (i == 0)
            result.add(ans);
    }

    return result;
}