LeetCode 728. Self Dividing Numbers
Created at 20171221 Updated at 20180121 Category LeetCode
The question is pretty easy
Question
A selfdividing number is a number that is divisible by every digit it contains.
For example, 128 is a selfdividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.
Also, a selfdividing 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:


Note:
 The boundaries of each input argument are 1 <= left <= right <= 10000.
Solution
Loop each value in the range and check if current value is a selfdividing number
Code

