Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0701_0800.s0728_self_dividing_numbers.Solution

```
public class Solution
extends Object
```
728 - Self Dividing Numbers.
Easy

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.
A self-dividing number is not allowed to contain the digit zero.

Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right].

Example 1:

Input: left = 1, right = 22

Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]

Example 2:

Input: left = 47, right = 85

Output: [48,55,66,77]

Constraints:
- 1 <= left <= right <= 10⁴

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<Integer> selfDividingNumbers(int left, int right)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

selfDividingNumbers

public List<Integer> selfDividingNumbers(int left,
                                         int right)