标签：lis git contain out break pos bsp res dig
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.
判断一个整数，是否能整除所有组成自己的数字
C++(6ms):
1 class Solution { 2 public: 3 vector<int> selfDividingNumbers(int left, int right) { 4 vector<int> res ; 5 for(int i = left; i <= right ; i++){ 6 bool flag = true ; 7 int t = i ; 8 while(t){ 9 int d = t%10 ; 10 if (d == 0 || i%d ){ 11 flag = false ; 12 break ; 13 } 14 t /= 10 ; 15 } 16 if (flag) 17 res.push_back(i) ; 18 } 19 return res ; 20 } 21 };
java(7ms):
1 class Solution { 2 public List<Integer> selfDividingNumbers(int left, int right) { 3 List<Integer> res = new ArrayList<>() ; 4 for(int i = left; i <= right ; i++){ 5 boolean flag = true ; 6 int t = i ; 7 while(t>0){ 8 int d = t%10 ; 9 if (d == 0 || i%d!=0 ){ 10 flag = false ; 11 break ; 12 } 13 t /= 10 ; 14 } 15 if (flag) 16 res.add(i) ; 17 } 18 return res ; 19 } 20 }
标签：lis git contain out break pos bsp res dig
原文地址：http://www.cnblogs.com/mengchunchen/p/7872137.html
