标签：desc while check return clu ret int inpu ber
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.
class Solution { public List<Integer> selfDividingNumbers(int left, int right) { List<Integer> arr = new ArrayList<Integer> (); for(int i = left; i<=right; i++){ if(Check(i)){ arr.add(i); } } return arr; } boolean Check(int n){ String a = Integer.toString(n); for(int i = 0; i < a.length(); i++ ){ if(a.charAt(i)==‘0‘){ return false; } } int digit =0; int tmp = n; do{ digit = tmp%10; if(n%digit!= 0){ return false; } tmp = tmp/10; } while(tmp>0); return true; } }
(Easy) Self Dividing Numbers LeetCode
标签：desc while check return clu ret int inpu ber
原文地址：https://www.cnblogs.com/codingyangmao/p/11396034.html
