LeetCode 728. Self Dividing Numbers
撰写于 2017-12-21 修改于 2018-01-21 分类 LeetCode
The question is pretty 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.
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.
- The boundaries of each input argument are 1 <= left <= right <= 10000.
Loop each value in the range and check if current value is a self-dividing number