标签：nbsp numbers aries href each new void because ret
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:
1 <= left <= right <= 10000.
using System;using System.Collections.Generic;namespace ConsoleApp1{class Program{public static List<int> SelfDividingNumbers(int left, int right){List<int> res = new List<int>();for (int i = left; i <= right; i++){if (IsDividingNumbers(i)){res.Add(i);}}return res;}public static bool IsDividingNumbers(int number){var d = 1;while (d < number){var num = (number / d) % 10;if (num == 0 || number % num != 0){return false;}d *= 10;}return true;}static void Main(string[] args){var res = SelfDividingNumbers(1, 21);Console.Write(res);}}}
728. Self Dividing Numbers 自分数
标签：nbsp numbers aries href each new void because ret
原文地址：http://www.cnblogs.com/xiejunzhao/p/7896308.html
