[LeetCode] 728. Self Dividing Numbers

Problem:

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 = 22Output: [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.

Solution:

class Solution {public:    vector<int> selfDividingNumbers(int left, int right) {        vector<int> sdn;        for (int i = left; i <= right; i++) {            if (checkSelfDividing(i))                sdn.push_back(i);        }        return sdn;    }        bool checkSelfDividing(int num) {        // mod 10取末位 整除10去除末位        for (int i = num; i > 0; i /= 10) {            if (i % 10 == 0 || num % (i % 10) != 0)                return false;        }        return true;    }};