728. Self Dividing Numbers

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.

 

判断一个整数，是否能整除所有组成自己的数字

 

 

C++(6ms):

class Solution {
public:
    vector<int> selfDividingNumbers(int left, int right) {
        vector<int> res ;
        for(int i = left; i <= right ; i++){
            bool flag = true ;
            int t = i ;
            while(t){
                int d = t%10 ;
                if (d == 0 || i%d ){
                    flag = false ;
                    break ;
                }
                t /= 10 ;
            }
            if (flag)
              res.push_back(i) ;
        }
        return res ;
    }
};

 

 

java(7ms):

class Solution {
    public List<Integer> selfDividingNumbers(int left, int right) {
        List<Integer> res = new ArrayList<>() ;  
        for(int i = left; i <= right ; i++){
            boolean flag = true ;
            int t = i ;
            while(t>0){
                int d = t%10 ;
                if (d == 0 || i%d!=0 ){
                    flag = false ;
                    break ;
                }
                t /= 10 ;
            }
            if (flag)
              res.add(i) ;
        }
        return res ;
    }
}