728. Self Dividing Numbers ----E

Q:

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.

A:

就是一个个数呗。没啥好办法

class Solution {
public:
    vector<int> selfDividingNumbers(int left, int right) {
        vector<int> res;
        for(int i = left; i<= right; ++i){
            if(isSelf(i))
                res.push_back(i);
        }
        return res;
    }
private:
    bool isSelf(int v){
        int origV = v;
        while(v>0)
        {
            int r = v%10;
            v = v/10;
            if(r == 0 || origV % r != 0)
                return false;
        }
        return true;
    }
};