[LeetCode] Self Dividing Numbers 自整除数字

标签：input   clu   数字   ever   code   tput   dig   etc   possible   

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.

s

[LeetCode] Self Dividing Numbers 自整除数字

标签：input   clu   数字   ever   code   tput   dig   etc   possible   

原文地址：http://www.cnblogs.com/grandyang/p/7906786.html