Leetcode——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.

解题：
直接模拟即可。

class Solution {public:    bool flag=false,is_ok[10001];    bool judge(int x)    {        int t=x;        while(x)        {            if(x%10==0)return false;            if(t%(x%10))return false;            x/=10;        }        return true;    }    void cal()    {        for(int i=1;i<=10000;i++)        {            if(judge(i))                is_ok[i]=1;            else                is_ok[i]=0;        }        flag=true;    }    vector<int> selfDividingNumbers(int left, int right) {        vector <int> res;        if(!flag){            cal();        }        for(int i=left;i<=right;i++)        {            if(is_ok[i])            res.push_back(i);        }        return res;    }};